summaryrefslogtreecommitdiff
path: root/content/other/josephus2.cpp
AgeCommit message (Collapse)Author
2024-07-28Test (#4)mzuenni
* 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>
"../util.h" constexpr ll inf = LL::INF; #include <other/knuth.cpp> vector<vector<ll>> gen(int n) { vector<vector<ll>> res(n, vector<ll>(n)); ll mi = 0; for (ll a = n-1; a >= 0; a--) { for (ll c = n-1; c >= a; c--) { for (ll b = a; b <= c; b++) { for (ll d = c; d < n; d++) { res[a][c] = min(res[a][c], res[a][d] + res[b][c] - res[b][d]); } } res[a][c] -= Random::integer<ll>(0, 1000); mi = min(mi, res[a][c]); } } for (auto& v : res) for (auto& x : v) x -= mi; for (ll a = 0; a < n; a++) { for (ll b = a; b < n; b++) { for (ll c = b; c < n; c++) { for (ll d = c; d < n; d++) { if (res[a][d] < 0 || res[a][d] + res[b][c] < res[a][c] + res[b][d]) { cerr << "invalid C array!" << FAIL; } } } } } return res; } vector<vector<ll>> genQuick(int n) { vector<vector<ll>> res(n, vector<ll>(n)); for (ll a = n-1; a >= 0; a--) { for (ll c = n-1; c >= a; c--) { res[a][c] = (c-a) * (c - a) + Random::integer<ll>(0, 2); } } return res; } /*ll naive(int n, int m, const vector<vector<ll>>& C) { vector<vector<ll>> state(m+1, vector<ll>(n+1, inf)); state[0][0] = 0; for (int i = 1; i <= m; i++) { for (int j = 1; j <= n; j++) { for (int k = 1; k <= j; k++) { state[i][j] = min(state[i][j], state[i-1][k-1] + C[k-1][j-1]); } } } return state[m][n]; }*/ vector<ll> naive(int n, const vector<vector<ll>>& C) { vector<vector<ll>> state(n+1, vector<ll>(n+1, inf)); state[0][0] = 0; vector<ll> res(n+1, inf); for (int i = 1; i <= n; i++) { for (int j = 1; j <= n; j++) { for (int k = 1; k <= j; k++) { state[i][j] = min(state[i][j], state[i-1][k-1] + C[k-1][j-1]); } } res[i] = state[i][n]; } return res; } void stress_test() { ll tests = 0; for (ll i = 0; i < 1000; i++) { auto n = Random::integer(10, 20); auto C = gen(n); auto expected = naive(n, C); for (ll m = 1; m <= n; m++) { auto got = calc(n, m, C); if (got != expected[m]) cerr << "got: " << got << ", expected: " << expected[m] << FAIL; tests++; } } cerr << "tested random queries: " << tests << endl; } constexpr int N = 5000; void performance_test() { timer t; auto C = genQuick(N); t.start(); auto hash = calc(N, N/2, C); 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(); }