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 <noob999noob999@gmail.com>

1 files changed, 76 insertions, 0 deletions

diff --git a/test/math/longestIncreasingSubsequence.cpp b/test/math/longestIncreasingSubsequence.cpp
new file mode 100644
index 0000000..407dafe
--- /dev/null
+++ b/test/math/longestIncreasingSubsequence.cpp
@@ -0,0 +1,76 @@
+#include "../util.h"
+constexpr ll INF = LL::INF;
+#include <math/longestIncreasingSubsequence.cpp>
+#define lis unstrictLis
+#define lower_bound upper_bound
+#include <math/longestIncreasingSubsequence.cpp>
+#undef lower_bound
+#undef lis
+
+template<bool STRICT>
+bool isLis(const vector<ll>& a, const vector<int>& lis) {
+	for (int i = 1; i < sz(lis); i++) {
+		if (lis[i-1] >= lis[i]) return false;
+		if (a[lis[i-1]] > a[lis[i]]) return false;
+		if (STRICT && a[lis[i-1]] == a[lis[i]]) return false;
+	}
+	return true;
+}
+
+template<bool STRICT>
+vector<int> naive(const vector<ll>& a) {
+	vector<int> res;
+	for (ll i = 1; i < (1ll << sz(a)); i++) {
+		vector<int> tmp;
+		for (ll j = 0; j < sz(a); j++) {
+			if (((i >> j) & 1) != 0) tmp.push_back(j);
+		}
+		if (sz(tmp) >= sz(res) && isLis<STRICT>(a, tmp)) res = tmp;
+	}
+	return res;
+}
+
+void stress_test() {
+	ll queries = 0;
+	for (ll i = 0; i < 10'000; i++) {
+		int n = Random::integer<int>(1, 12);
+		auto a = Random::integers<ll>(n, -10, 10);
+		auto expected = naive<true>(a);
+		auto got = lis(a);
+		if (got != expected) cerr << "error: strict" << FAIL;
+		queries += n;
+	}
+	for (ll i = 0; i < 10'000; i++) {
+		int n = Random::integer<int>(1, 12);
+		auto a = Random::integers<ll>(n, -10, 10);
+		auto expected = naive<false>(a);
+		auto got = unstrictLis(a);
+		if (got != expected) cerr << "error: not strict" << FAIL;
+		queries += n;
+	}
+	cerr << "tested random queries: " << queries << endl;
+}
+
+constexpr int N = 1'000'000;
+void performance_test() {
+	timer t;
+	auto a = Random::integers<ll>(N, -10'000, 10'000);
+	auto b = Random::integers<ll>(N, -10'000, 10'000);
+	sort(all(b));
+	auto c = Random::integers<ll>(N, -10'000, 10'000);
+	sort(all(c));
+	reverse(all(c));
+	hash_t hash = 0;
+	t.start();
+	hash += lis(a).size();
+	hash += lis(b).size();
+	hash += lis(c).size();
+	t.stop();
+	if (t.time > 500) cerr << "too slow: " << t.time << FAIL;
+	cerr << "tested performance: " << t.time << "ms (hash: " << hash << ")" << endl;
+}
+
+int main() {
+	stress_test();
+	performance_test();
+}