2 files changed, 188 insertions, 0 deletions
diff --git a/datastructures/test/lazyPropagation.awk b/datastructures/test/lazyPropagation.awk
new file mode 100644
index 0000000..fc39305
--- /dev/null
+++ b/datastructures/test/lazyPropagation.awk
@@ -0,0 +1,86 @@
+
+/Neutral element for combine/ {
+	print "#ifndef SEGTREE_FIRST_NEG"
+	print "# ifndef SEGTREE_MAX"
+	print
+	print "# else"
+	tmp = $0
+	sub(/0/, "numeric_limits<T>::min()", tmp)
+	print tmp
+	print "# endif"
+	print "#else"
+	sub(/0/, "numeric_limits<T>::max()")
+	print
+	print "#endif"
+	next
+}
+
+/Modify this \+ E/ {
+	print "#ifndef SEGTREE_FIRST_NEG"
+	print "# ifndef SEGTREE_MAX"
+	print
+	print "# else"
+	tmp = $0
+	sub(/a \+ b/, "max(a, b)", tmp)
+	print tmp
+	print "# endif"
+	print "#else"
+	sub(/a \+ b/, "a < 0 ? a : min(a, b)")
+	print
+	print "#endif"
+	next
+}
+
+/Unused value by updates/ {
+	print "#ifndef SEGTREE_FIRST_NEG"
+	print
+	print "#else"
+	sub(/0/, /numeric_limits<U>::max()/)
+	print
+	print "#endif"
+	next
+}
+
+/And this \+ UF/ {
+	print
+	getline set_tree
+	getline set_lazy
+	print "#ifndef SEGTREE_MAX"
+	print "# ifndef SEGTREE_FIRST_NEG"
+	print set_tree
+	print "# else"
+	tmp = set_tree
+	sub(/val \* k\[i\]/, "val", tmp)
+	print tmp
+	print "# endif"
+	print set_lazy
+	print "#else"
+	sub(/= val \* k\[i\]/, "+= val", set_tree)
+	sub(/= val/, "+= val", set_lazy)
+	print set_tree
+	print set_lazy
+	print "#endif"
+	next
+}
+
+/Optional/ { print "#ifdef SEGTREE_MAX" }
+/^\};$/ { print "#endif" }
+
+/SegTree\(const vector<T>& a\)/ {
+	print "#ifndef SEGTREE_INIT_DEFAULT"
+	print
+	print "#else"
+	getline
+	sub(/\/\//, "")
+	print
+	print "#endif"
+	getline
+	print
+	print "#ifndef SEGTREE_INIT_DEFAULT"
+	getline
+	print
+	print "#endif"
+	next
+}
+
+{ print }
diff --git a/datastructures/test/lazyPropagation.cpp b/datastructures/test/lazyPropagation.cpp
new file mode 100644
index 0000000..df97b14
--- /dev/null
+++ b/datastructures/test/lazyPropagation.cpp
@@ -0,0 +1,102 @@
+#include "lazyPropagation.tmp.cpp"
+
+void test(int n) {
+#ifndef SEGTREE_INIT_DEFAULT
+	vector<ll> a(n);
+	for (ll &x: a) x = util::randint();
+	SegTree seg(a);
+#else
+	ll init = util::randint();
+# ifdef SEGTREE_FIRST_NEG
+	init = abs(init);
+# endif
+	vector<ll> a(n, init);
+	SegTree seg(n, init);
+#endif
+	for (int i = 0; i < 5*n; i++) {
+		{
+			int l = util::randint(n+1);
+			int r = util::randint(n+1);
+			if (l > r) swap(l, r);
+			ll v = util::randint();
+#ifndef SEGTREE_FIRST_NEG
+# ifndef SEGTREE_MAX
+			if (v == 0) v = 1;
+# endif
+#endif
+			for (int j = l; j < r; j++) {
+#ifndef SEGTREE_MAX
+				a[j] = v;
+#else
+				a[j] += v;
+#endif
+			}
+			seg.update(l, r, v);
+		}
+		{
+			int l = util::randint(n+1);
+			int r = util::randint(n+1);
+			if (l > r) swap(l, r);
+#ifndef SEGTREE_FIRST_NEG
+# ifndef SEGTREE_MAX
+			ll comp = 0;
+# else
+			ll comp = numeric_limits<ll>::min();
+# endif
+#else
+			ll comp = numeric_limits<ll>::max();
+#endif
+			for (int j = l; j < r; j++) {
+#ifndef SEGTREE_FIRST_NEG
+# ifndef SEGTREE_MAX
+				comp += a[j];
+# else
+				comp = max(comp, a[j]);
+# endif
+#else
+				if (comp >= 0 && comp > a[j]) comp = a[j];
+#endif
+			}
+			assert(seg.query(l, r) == comp);
+		}
+#ifdef SEGTREE_MAX
+		{
+			int l = util::randint(n+1);
+			int r = util::randint(n+1);
+			if (l > r) swap(l, r);
+			ll bound = util::randint();
+			int found = -1;
+			for (int j = l; j < r; j++) {
+				if (a[j] >= bound) {
+					found = j;
+					break;
+				}
+			}
+			assert(seg.lower_bound(l, r, bound) == found);
+		}
+#endif
+	}
+}
+
+int main() {
+	test(1000);
+	test(1);
+	{
+#ifndef SEGTREE_INIT_DEFAULT
+		vector<ll> a;
+		SegTree seg(a);
+#else
+		SegTree seg(0);
+#endif
+		seg.update(0, 0, util::randint());
+#ifndef SEGTREE_FIRST_NEG
+# ifndef SEGTREE_MAX
+		assert(seg.query(0, 0) == 0);
+# else
+		assert(seg.query(0, 0) == numeric_limits<ll>::min());
+# endif
+#else
+		assert(seg.query(0, 0) == numeric_limits<ll>::max());
+#endif
+	}
+}