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, 46 insertions, 0 deletions

diff --git a/content/datastructures/lichao.cpp b/content/datastructures/lichao.cpp
new file mode 100644
index 0000000..f66778e
--- /dev/null
+++ b/content/datastructures/lichao.cpp
@@ -0,0 +1,46 @@
+vector<ll> xs; // IMPORTANT: Initialize before constructing!
+int findX(int i) {return lower_bound(all(xs), i) - begin(xs);}
+
+struct Fun { // Default: Linear function. Change as needed. 
+	ll m, c;
+	ll operator()(int x) {return m*xs[x] + c;}
+};
+
+// Default: Computes min. Change lines with comment for max.
+struct Lichao {
+	static constexpr Fun id = {0, inf}; // {0, -inf}
+	int n, cap;
+	vector<Fun> seg;
+	Lichao() : n(sz(xs)), cap(2<<__lg(n)), seg(2*cap, id) {}
+	
+	void _insert(Fun f, int l, int r, int i) {
+		while (i < 2*cap){
+			int m = (l+r)/2;
+			if (m >= n) {r = m; i = 2*i; continue;}
+			Fun &g = seg[i];
+			if (f(m) < g(m)) swap(f, g); // >
+			if (f(l) < g(l)) r = m, i = 2*i; // >
+			else l = m, i = 2*i+1;
+	}}
+	void insert(Fun f) {_insert(f, 0, cap, 1);}
+
+	void _segmentInsert(Fun f, int l, int r, int a, int b, int i) {
+		if (l <= a && b <= r) _insert(f, a, b, i);
+		else if (a < r && l < b){
+			int m = (a+b)/2;
+			_segmentInsert(f, l, r, a, m, 2*i);
+			_segmentInsert(f, l, r, m, b, 2*i+1);
+	}}
+	void segmentInsert(Fun f, ll l, ll r) {
+		_segmentInsert(f, findX(l), findX(r), 0, cap, 1);
+	}
+
+	ll _query(int x) {
+		ll ans = inf; // -inf
+		for (int i = x + cap; i > 0; i /= 2) {
+			ans = min(ans, seg[i](x)); // max
+		}
+		return ans;
+	}
+	ll query(ll x) {return _query(findX(x));}
+};