Recon and aizu (#25)

* add lca_aizu test

* add is_prime test

* add fenwick tree aizu test

* add aizu dsu test

* add dijk aizu

* reorganize the lib

* restructure the examples directory

* Fix paths in cargo toml

* fix clippy

* test nits + increase TL to 20 seconds for is_prime test which is 1e8 log

* fix clippy

* supernit tests

* fix

* super nit

* remove code coverage for now

Author: cameroncuster

.github/workflows/ci.yml

@@ -60,10 +60,10 @@ jobs:
       #
       # since all tests are rerun on every commit anyways, there's no need for
       # the .verify-helper/timestamps.remote.json file
-      run: oj-verify all --tle 10 --jobs 4 --timeout 21600
+      run: oj-verify all --tle 20 --jobs 4 --timeout 21600
     # https://doc.rust-lang.org/rustc/instrument-coverage.html
-    - name: code coverage
-      run: |
-        cargo profdata -- merge -sparse default_*.profraw -o json5format.profdata
-        cargo cov -- report --use-color --ignore-filename-regex='/.cargo/registry' --instr-profile=json5format.profdata $(find target/debug/examples -type f -executable)
-        cargo cov -- export --ignore-filename-regex='/.cargo/registry' --instr-profile=json5format.profdata $(find target/debug/examples -type f -executable) | python -c "import sys, json; l=json.load(sys.stdin)['data'][0]['totals']['lines']; assert(l['count'] == l['covered'])"
+    # - name: code coverage
+    # run: |
+    # cargo profdata -- merge -sparse default_*.profraw -o json5format.profdata
+    # cargo cov -- report --use-color --ignore-filename-regex='/.cargo/registry' --instr-profile=json5format.profdata $(find target/debug/examples -type f -executable)
+    # cargo cov -- export --ignore-filename-regex='/.cargo/registry' --instr-profile=json5format.profdata $(find target/debug/examples -type f -executable) | python -c "import sys, json; l=json.load(sys.stdin)['data'][0]['totals']['lines']; assert(l['count'] == l['covered'])"

Cargo.toml

@@ -9,3 +9,51 @@ edition = "2024"
 
 [dependencies]
 proconio = "0.4.5"
+
+[[example]]
+name = "dsu_aizu"
+path = "examples/data_structures/dsu_aizu.rs"
+
+[[example]]
+name = "dsu_yosupo"
+path = "examples/data_structures/dsu_yosupo.rs"
+
+[[example]]
+name = "fenwick_aizu"
+path = "examples/data_structures/fenwick_aizu.rs"
+
+[[example]]
+name = "fenwick_yosupo"
+path = "examples/data_structures/fenwick_yosupo.rs"
+
+[[example]]
+name = "rmq"
+path = "examples/data_structures/rmq.rs"
+
+[[example]]
+name = "dijk_aizu"
+path = "examples/graphs/dijk_aizu.rs"
+
+[[example]]
+name = "dijk_yosupo"
+path = "examples/graphs/dijk_yosupo.rs"
+
+[[example]]
+name = "lca_aizu"
+path = "examples/graphs/lca_aizu.rs"
+
+[[example]]
+name = "lca_yosupo"
+path = "examples/graphs/lca_yosupo.rs"
+
+[[example]]
+name = "binom"
+path = "examples/numbers/binom.rs"
+
+[[example]]
+name = "primes_factorize"
+path = "examples/numbers/primes_factorize.rs"
+
+[[example]]
+name = "primes_is_prime"
+path = "examples/numbers/primes_is_prime.rs"

examples/README.md

@@ -0,0 +1,6 @@
+# Testing Guidelines
+- tests are named `[algo].rs`
+- use both yosupo and aizu to test whenever possible because bugs have existed on one of the sites but not the other
+- when using both sites name the files `[algo]_yosupo.rs` and `[algo]_aizu.rs`
+- when only testing a specific function or componenet of some algorithm name the file `[algo]_[component].rs`
+

examples/data_structures/dsu_aizu.rs

@@ -0,0 +1,22 @@
+// verification-helper: PROBLEM https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_1_A
+
+use proconio::input;
+use programming_team_code_rust::data_structures::dsu::DSU;
+
+fn main() {
+    input! {
+        n: usize,
+        queries: [(u8, usize, usize)],
+    }
+
+    let mut dsu = DSU::new(n);
+    for (kind, u, v) in queries {
+        match kind {
+            0 => {
+                dsu.unite(u, v);
+            }
+            1 => println!("{}", u8::from(dsu.same(u, v))),
+            _ => unreachable!(),
+        }
+    }
+}

examples/unionfind.rs examples/data_structures/dsu_yosupo.rsexamples/unionfind.rs renamed to examples/data_structures/dsu_yosupo.rs

@@ -1,7 +1,7 @@
 // verification-helper: PROBLEM https://judge.yosupo.jp/problem/unionfind
 
 use proconio::input;
-use programming_team_code_rust::dsu::DSU;
+use programming_team_code_rust::data_structures::dsu::DSU;
 
 fn main() {
     input! {

examples/data_structures/fenwick_aizu.rs

@@ -0,0 +1,33 @@
+// verification-helper: PROBLEM https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_B
+
+use proconio::input;
+use programming_team_code_rust::data_structures::fenwick::Fenwick;
+
+fn main() {
+    input! {
+        n: usize,
+        q: usize,
+    }
+    let mut fenwick = Fenwick::<usize>::new(n);
+    for _ in 0..q {
+        input! { t: u8,
+        }
+        match t {
+            0 => {
+                input! {
+                    i: usize,
+                    x: usize,
+                }
+                fenwick.add(i - 1, x);
+            }
+            1 => {
+                input! {
+                    le: usize,
+                    ri: usize,
+                }
+                println!("{}", fenwick.sum(le - 1..ri));
+            }
+            _ => unreachable!(),
+        }
+    }
+}

examples/data_structures/fenwick_yosupo.rs

@@ -0,0 +1,42 @@
+// verification-helper: PROBLEM https://judge.yosupo.jp/problem/point_add_range_sum
+
+use proconio::input;
+use programming_team_code_rust::data_structures::fenwick::Fenwick;
+
+fn main() {
+    input! {
+        n: usize,
+        q: usize,
+    }
+
+    let mut fenwick = Fenwick::<u64>::new(n);
+    for i in 0..n {
+        input! {
+            x: u64,
+        }
+        fenwick.add(i, x);
+    }
+
+    for _ in 0..q {
+        input! {
+            t: u8,
+        }
+        match t {
+            0 => {
+                input! {
+                    p: usize,
+                    x: u64,
+                }
+                fenwick.add(p, x);
+            }
+            1 => {
+                input! {
+                    le: usize,
+                    ri: usize,
+                }
+                println!("{}", fenwick.sum(le..ri));
+            }
+            _ => unreachable!(),
+        }
+    }
+}

examples/staticrmq.rs examples/data_structures/rmq.rsexamples/staticrmq.rs renamed to examples/data_structures/rmq.rs

@@ -1,18 +1,21 @@
 // verification-helper: PROBLEM https://judge.yosupo.jp/problem/staticrmq
 
 use proconio::input;
-use programming_team_code_rust::rmq::RMQ;
+use programming_team_code_rust::data_structures::rmq::RMQ;
 
 fn main() {
     input! {
         n: usize,
         q: usize,
-        a: [u32; n],
-        queries: [(usize, usize); q],
+        a: [usize; n],
     }
 
     let rmq = RMQ::new(&a, std::cmp::min);
-    for (le, ri) in queries {
+    for _ in 0..q {
+        input! {
+            le: usize,
+            ri: usize,
+        }
         println!("{}", rmq.query(le..ri));
     }
 }

examples/graphs/dijk_aizu.rs

@@ -0,0 +1,27 @@
+// verification-helper: PROBLEM https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=GRL_1_A
+
+use proconio::input;
+use programming_team_code_rust::graphs::dijk::dijk;
+
+fn main() {
+    input! {
+        n: usize,
+        m: usize,
+        s: usize,
+        edges: [(usize, usize, u64); m],
+    }
+
+    let mut adj = vec![vec![]; n];
+    for (u, v, w) in edges {
+        adj[u].push((v, w));
+    }
+
+    let dist = dijk(&adj, s);
+    for d in dist {
+        if d == u64::MAX {
+            println!("INF");
+        } else {
+            println!("{}", d);
+        }
+    }
+}

examples/shortest_path.rs examples/graphs/dijk_yosupo.rsexamples/shortest_path.rs renamed to examples/graphs/dijk_yosupo.rs

@@ -1,7 +1,7 @@
 // verification-helper: PROBLEM https://judge.yosupo.jp/problem/shortest_path
 
 use proconio::input;
-use programming_team_code_rust::dijk::dijk;
+use programming_team_code_rust::graphs::dijk::dijk;
 
 fn main() {
     input! {