From 8d11c6c8213f46f0fa19826917c255edd5d43cb1 Mon Sep 17 00:00:00 2001 From: mzuenni Date: Sun, 28 Jul 2024 22:54:40 +0200 Subject: Test (#4) * update * moved content in subdir * rename file * add test setup * add test setup * add github action * automaticly test all cpp files * timeout after 10s * setulimit and dont zero memory * test build pdf * install latexmk * update * update * ngerman * fonts * removed old code * add first test * added tests * test in sorted order * more tests * simplified test * more tests * fix suffix tree * fixes and improvements * done ust lst directly * fix swap * add links to pdf * fix constants * add primorial * add comment * various improvements * more tests * added missing stuf * more tests * fix tests * more tests * more tests * more tests * fix recursion? * test trie * more tests * only use python temporarily for listings * only use python temporarily for listings * more tests * fix longestCommonSubstring * more tests * more tests * made code more similiar * fix? * more tests * more tests * more tests * add ahoCorasick test + limit 4GB stack size * more tests * fix test * add additional test * more tests * more tests * fix? * better fix * fix virtual tree * more tests * more tests * recursive closest pair * more tests * decrease limit * new tests * more tests * fix name * more tests * add test * new test * more tests * more tests * more tests * more tests * new test and content * new code * new code * larger tests * fix and test * new test * new test * update pdf * remove comments * new test * more tests * more testcases * more tests * increased limit * more tests * more tests * more tests * new tests * more tests * shortened code * new test * add basic tests for bigint * more tests * removed old files * new test * ignore some files * more auto more ccw * fix test * more tests * fix * new tests * more tests * more tests * stronger test * actually verify delaunay... * more tests * fix header * more tests * run tests parallel? * test parralel? * add --missing * separate workflows * test * is the pdf checked? * separate workflows * fix workflow * more workflows --------- Co-authored-by: Yidi --- content/datastructures/lazyPropagation.cpp | 85 ++++++++++++++++++++++++++++++ 1 file changed, 85 insertions(+) create mode 100644 content/datastructures/lazyPropagation.cpp (limited to 'content/datastructures/lazyPropagation.cpp') diff --git a/content/datastructures/lazyPropagation.cpp b/content/datastructures/lazyPropagation.cpp new file mode 100644 index 0000000..441590e --- /dev/null +++ b/content/datastructures/lazyPropagation.cpp @@ -0,0 +1,85 @@ +struct SegTree { + using T = ll; using U = ll; + int n; + static constexpr T E = 0; // Neutral element for combine + static constexpr U UF = inf; // Unused value by updates + vector tree; + int h; + vector lazy; + vector k; // size of segments (optional) + + SegTree(const vector& a) : n(sz(a) + 1), tree(2 * n, E), + //SegTree(int size, T def = E) : n(size + 1), tree(2 * n, def), + h(__lg(2 * n)), lazy(n, UF), k(2 * n, 1) { + copy(all(a), tree.begin() + n); + for (int i = n - 1; i > 0; i--) { + k[i] = 2 * k[2 * i]; + tree[i] = comb(tree[2 * i], tree[2 * i + 1]); + }} + + T comb(T a, T b) {return a + b;} // Modify this + E + + void apply(int i, U val) { // And this + UF + tree[i] = val * k[i]; + if (i < n) lazy[i] = val; // Don't forget this + } + + void push_down(int i) { + if (lazy[i] != UF) { + apply(2 * i, lazy[i]); + apply(2 * i + 1, lazy[i]); + lazy[i] = UF; + }} + + void push(int i) { + for (int s = h; s > 0; s--) push_down(i >> s); + } + + void build(int i) { + while (i /= 2) { + push_down(i); + tree[i] = comb(tree[2 * i], tree[2 * i + 1]); + }} + + void update(int l, int r, U val) { + l += n, r += n; + int l0 = l, r0 = r; + push(l0), push(r0 - 1); + for (; l < r; l /= 2, r /= 2) { + if (l&1) apply(l++, val); + if (r&1) apply(--r, val); + } + build(l0), build(r0 - 1); + } + + T query(int l, int r) { + l += n, r += n; + push(l), push(r - 1); + T resL = E, resR = E; + for (; l < r; l /= 2, r /= 2) { + if (l&1) resL = comb(resL, tree[l++]); + if (r&1) resR = comb(tree[--r], resR); + } + return comb(resL, resR); + } + + // Optional: + int lower_bound(int l, int r, T x) { + l += n, r += n; + push(l), push(r - 1); + int a[64] = {}, lp = 0, rp = 64; + for (; l < r; l /= 2, r /= 2) { + if (l&1) a[lp++] = l++; + if (r&1) a[--rp] = --r; + } + for (int i : a) if (i != 0 && tree[i] >= x) { // Modify this + while (i < n) { + push_down(i); + if (tree[2 * i] >= x) i = 2 * i; // And this + else i = 2 * i + 1; + } + return i - n; + } + return -1; + } +}; -- cgit v1.2.3