mzuenni tests

1 files changed, 63 insertions, 0 deletions

diff --git a/test/graph/LCA_sparse.cpp b/test/graph/LCA_sparse.cpp
new file mode 100644
index 0000000..f6eb345
--- /dev/null
+++ b/test/graph/LCA_sparse.cpp
@@ -0,0 +1,63 @@
+#include "../util.h"
+#include <datastructures/sparseTable.cpp>
+#include <graph/LCA_sparse.cpp>
+namespace expected {
+#include <graph/hld.cpp>
+}
+
+void stress_test() {
+	ll queries = 0;
+	for (int tries = 0; tries < 200'000; tries++) {
+		int n = Random::integer<int>(2, 30);
+		Graph<NoData> g(n);
+		g.tree();
+
+		vector<vector<int>> adj(n);
+		g.forEdges([&](int a, int b){
+			adj[a].push_back(b);
+			adj[b].push_back(a);
+		});
+
+		LCA lca;
+		lca.init(adj, 0);
+
+		expected::adj = adj;
+		expected::init();
+
+		for (int i = 0; i < n; i++) {
+			for (int j = 0; j <= i; j++) {
+				auto got = lca.getLCA(i, j);
+				auto expected = expected::get_lca(i, j);
+				if (got != expected) cerr << "got: " << got  << ", expected: " << expected << FAIL;
+			}
+		}
+		queries += n;
+	}
+	cerr << "tested random queries: " << queries << endl;
+}
+
+constexpr int N = 1'000'000;
+void performance_test() {
+	timer t;
+	Graph<NoData> g(N);
+	g.tree();
+	vector<vector<int>> adj(N);
+	g.forEdges([&](int a, int b){
+		adj[a].push_back(b);
+		adj[b].push_back(a);
+	});
+
+	hash_t hash = 0;
+	t.start();
+	LCA lca;
+	lca.init(adj, 0);
+	for (int i = 1; i < N; i++) hash += lca.getLCA(i-1, i);
+	t.stop();
+	if (t.time > 1000) cerr << "too slow: " << t.time << FAIL;
+	cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
+}
+
+int main() {
+	stress_test();
+	performance_test();
+}