run with sanitizer

Author: mzuenni

.github/workflows/test_all.yml

@@ -8,7 +8,7 @@ jobs:
         os: [ubuntu-latest, ubuntu-22.04]
     name: Test all (${{ matrix.os }})
     runs-on: ${{ matrix.os }}
-    timeout-minutes: 20
+    timeout-minutes: 50
     steps:
       - uses: actions/checkout@v4
       - run: ./test/test.sh

.github/workflows/test_datastructures.yml

@@ -16,7 +16,7 @@ jobs:
         os: [ubuntu-latest, ubuntu-22.04]
     name: Test datastructures (${{ matrix.os }})
     runs-on: ${{ matrix.os }}
-    timeout-minutes: 10
+    timeout-minutes: 20
     steps:
       - uses: actions/checkout@v4
       - run: ./test/test.sh datastructures

.github/workflows/test_geometry.yml

@@ -16,7 +16,7 @@ jobs:
         os: [ubuntu-latest, ubuntu-22.04]
     name: Test geometry (${{ matrix.os }})
     runs-on: ${{ matrix.os }}
-    timeout-minutes: 10
+    timeout-minutes: 20
     steps:
       - uses: actions/checkout@v4
       - run: ./test/test.sh geometry

.github/workflows/test_graph.yml

@@ -16,7 +16,7 @@ jobs:
         os: [ubuntu-latest, ubuntu-22.04]
     name: Test graph (${{ matrix.os }})
     runs-on: ${{ matrix.os }}
-    timeout-minutes: 10
+    timeout-minutes: 30
     steps:
       - uses: actions/checkout@v4
       - run: ./test/test.sh graph

.github/workflows/test_math.yml

@@ -16,7 +16,7 @@ jobs:
         os: [ubuntu-latest, ubuntu-22.04]
     name: Test math (${{ matrix.os }})
     runs-on: ${{ matrix.os }}
-    timeout-minutes: 10
+    timeout-minutes: 30
     steps:
       - uses: actions/checkout@v4
       - run: ./test/test.sh math

content/graph/bitonicTSP.cpp

@@ -1,6 +1,6 @@
 vector<vector<double>> dist; // Initialisiere mit Entfernungen zwischen Punkten.
 
-auto bitonicTSP() {
+auto bitonicTSP() { // n >= 2!
 	vector<double> dp(sz(dist), HUGE_VAL);
 	vector<int> pre(sz(dist)); // nur für Tour
 	dp[0] = 0; dp[1] = 2 * dist[0][1]; pre[1] = 0;

content/graph/matching.cpp

@@ -1,4 +1,4 @@
-constexpr int MOD=1'000'000'007, I=10;
+constexpr int mod=1'000'000'007, I=10;
 vector<vector<ll>> adj, mat;
 
 int max_matching() {
@@ -9,10 +9,10 @@ int max_matching() {
 			mat[v].assign(sz(adj), 0);
 			for (int u : adj[v]) {
 				if (u < v) {
-					mat[v][u] = rand() % (MOD - 1) + 1;
-					mat[u][v] = MOD - mat[v][u];
+					mat[v][u] = rand() % (mod - 1) + 1;
+					mat[u][v] = mod - mat[v][u];
 		}}}
-		gauss(sz(adj), MOD); //LGS @\sourceref{math/lgsFp.cpp}@
+		gauss(sz(mat), sz(mat[0])); //LGS @\sourceref{math/lgsFp.cpp}@
 		int rank = 0;
 		for (auto& row : mat) {
 			if (*max_element(all(row)) != 0) rank++;

content/math/gcd-lcm.cpp

@@ -6,7 +6,7 @@ ll memoC[N];
 
 void init() {
 	primeSieve(); // @\sourceref{math/primeSieve.cpp}@
-	for (ll i = 0; i < N; i++) {
+	for (ll i = 1; i < N; i++) {
 		memoC[i] = memoC[i - 1];
 		if (isPrime(i)) memoC[i]++;
 	}

content/math/piLehmer.cpp

@@ -194,5 +194,5 @@ void performance_test() {
 
 int main() {
 	stress_test();
-	performance_test();
+	if (!sanitize) performance_test();
 }