MCPcopy Create free account
hub / github.com/SuprDewd/CompetitiveProgramming / apply

Method apply

code/data-structures/segment_tree_node.cpp:12–12  ·  view source on GitHub ↗

Source from the content-addressed store, hash-verified

10 void update(ll v) { x = v; }
11 void range_update(ll v) { lazy = v; }
12 void apply() { x += lazy * (r - l + 1); lazy = 0; }
13 void push(node &u) { u.lazy += lazy; } };
14#endif
15// vim: cc=60 ts=2 sts=2 sw=2:

Callers 1

propagateMethod · 0.45

Calls

no outgoing calls

Tested by

no test coverage detected