Struct contest_algorithms::arq_tree::SupplyDemand

pub struct SupplyDemand;

Supply & Demand, based on https://codeforces.com/gym/102218/problem/F modify(i, i, &(p, o)) increases supply by p and demand by o at time i. query(l, r) computes total supply and demand at times l to r, as well as

Trait Implementations

impl ArqSpec for SupplyDemand

type F = (i64, i64)

Type of data representing an endomorphism.

type M = (i64, i64, i64)

Type of monoid elements.

fn compose(_: &Self::F, _: &Self::F) -> Self::F

For eager updates, compose() ho be unimplemented!(). For lazy updates: Require for all f,g,a: apply(compose(f, g), a) = apply(f, apply(g, a))

fn apply((p_add, o_add): &Self::F, (p, o, _): &Self::M) -> Self::M

For eager updates, apply() can assume to act on a leaf. For lazy updates: Require for all f,a,b: apply(f, op(a, b)) = op(apply(f, a), apply(f, b))

fn op((p1, o1, s1): &Self::M, (p2, o2, s2): &Self::M) -> Self::M

Require for all a,b,c: op(a, op(b, c)) = op(op(a, b), c)

fn identity() -> Self::M

Require for all a: op(a, identity()) = op(identity(), a) = a