From a24ce98f2c79d5594d171a9b294b1cf25b488ebc Mon Sep 17 00:00:00 2001
From: Gloria Mundi <gloria@gloria-mundi.eu>
Date: Wed, 1 May 2024 18:07:15 +0200
Subject: improve test system, fix segment tree, add more segment tree tests

---
 datastructures/test/segmentTree.cpp | 80 ++++++++++++++++++++++++++++++++++---
 1 file changed, 75 insertions(+), 5 deletions(-)

(limited to 'datastructures/test/segmentTree.cpp')

diff --git a/datastructures/test/segmentTree.cpp b/datastructures/test/segmentTree.cpp
index 79c16e6..44d99b6 100644
--- a/datastructures/test/segmentTree.cpp
+++ b/datastructures/test/segmentTree.cpp
@@ -1,25 +1,74 @@
+#ifdef SEGTREE_MUL
+constexpr ll MOD = 1'000'000'007;
+#endif
+
 #include "segmentTree.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++) {
 		{
+#ifndef SEGTREE_RANGE_UPDATE
 			int j = util::randint(n);
 			ll v = util::randint();
 			a[j] = v;
 			seg.update(j, v);
+#else
+			int l = util::randint(n+1);
+			int r = util::randint(n+1);
+			if (l > r) swap(l, r);
+			ll v = util::randint();
+			for (int j = l; j < r; j++) {
+# ifndef SEGTREE_MUL
+				a[j] += v;
+# else
+				a[j] = a[j]*v % MOD;
+# endif
+			}
+			seg.modify(l, r, v);
+#endif
 		}
 		{
+#ifndef SEGTREE_RANGE_UPDATE
 			int l = util::randint(n+1);
 			int r = util::randint(n+1);
 			if (l > r) swap(l, r);
-			assert(
-				seg.query(l, r)
-				==
-				accumulate(a.begin() + l, a.begin() + r, 0ll)
-			);
+# ifndef SEGTREE_MUL
+#  ifndef SEGTREE_FIRST_NEG
+			ll comp = 0;
+#  else
+			ll comp = numeric_limits<ll>::max();
+#  endif
+# else
+			ll comp = 1;
+# endif
+			for (int j = l; j < r; j++) {
+# ifndef SEGTREE_MUL
+#  ifndef SEGTREE_FIRST_NEG
+				comp += a[j];
+#  else
+				if (comp >= 0 && comp > a[j]) comp = a[j];
+#  endif
+# else
+				comp = comp * a[j] % MOD;
+# endif
+			}
+			assert(seg.query(l, r) == comp);
+#else
+			int j = util::randint(n);
+			assert(seg.query(j) == a[j]);
+#endif
 		}
 	}
 }
@@ -27,4 +76,25 @@ void test(int n) {
 int main() {
 	test(1000);
 	test(1);
+	{
+#ifndef SEGTREE_INIT_DEFAULT
+		vector<ll> a;
+		SegTree seg(a);
+#else
+		SegTree seg(0);
+#endif
+#ifndef SEGTREE_RANGE_UPDATE
+# ifndef SEGTREE_MUL
+#  ifndef SEGTREE_FIRST_NEG
+		assert(seg.query(0, 0) == 0);
+#  else
+		assert(seg.query(0, 0) == numeric_limits<ll>::max());
+#  endif
+# else
+		assert(seg.query(0, 0) == 1);
+# endif
+#else
+		seg.modify(0, 0, util::randint());
+#endif
+	}
 }
-- 
cgit v1.2.3