shorten other test

Author: lrvideckis

tests/library_checker_aizu_tests/trees/kth_path_linear.test.cpp

@@ -2,6 +2,8 @@
   "https://judge.yosupo.jp/problem/jump_on_tree"
 #include "../template.hpp"
 #include "../../../library/trees/linear_kth_path.hpp"
+#include "../../../library/trees/lca_rmq/lca_rmq.hpp"
+#include "../compress_tree_asserts.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
@@ -14,6 +16,8 @@ int main() {
     adj[v].push_back(u);
   }
   linear_kth_path lin_kth_path(adj);
+  LCA lc(adj);
+  compress_tree_asserts(adj, lc);
   while (q--) {
     int u, v, k;
     cin >> u >> v >> k;

tests/library_checker_aizu_tests/trees/kth_path_tree_lift.test.cpp

@@ -2,12 +2,8 @@
   "https://judge.yosupo.jp/problem/jump_on_tree"
 #include "../template.hpp"
 #include "../../../library/contest/random.hpp"
-#include "../../../library/monotonic_stack/monotonic_stack.hpp"
 #include "../../../library/trees/tree_lift/tree_lift.hpp"
 #include "../../../library/trees/lca_rmq/lca_rmq.hpp"
-#include "../../../library/trees/linear_lca.hpp"
-#include "../../../library/trees/linear_kth_path.hpp"
-#include "../compress_tree_asserts.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
@@ -21,42 +17,21 @@ int main() {
   }
   tree_lift tl(adj);
   LCA lc(adj);
-  linear_kth_path lin_kth_path(adj);
-  compress_tree_asserts(adj, lc);
   while (q--) {
     int u, v, k;
     cin >> u >> v >> k;
     int dist_in_edges = tl.dist_edges(u, v);
     assert(dist_in_edges == lc.dist_edges(u, v));
-    assert(dist_in_edges ==
-      lin_kth_path.lin_lca.dist_edges(u, v));
-    int res = tl.kth_path(u, v, k);
-    assert(res == lin_kth_path.kth_path(u, v, k));
-    cout << res << '\n';
+    cout << tl.kth_path(u, v, k) << '\n';
     {
       int w = rnd(0, n - 1);
       assert(lc.on_path(u, v, w) ==
-        (lc.dist_edges(u, w) + lc.dist_edges(w, v) ==
-          lc.dist_edges(u, v)));
+             (lc.dist_edges(u, w) + lc.dist_edges(w, v) ==
+              lc.dist_edges(u, v)));
     }
     if (u != v) {
-      assert(tl.kth_path(u, v, 0) == u);
-      assert(lin_kth_path.kth_path(u, v, 0) == u);
-      assert(
-        tl.kth_path(u, v, 1) == lc.next_on_path(u, v));
-      assert(lin_kth_path.kth_path(u, v, 1) ==
-        lc.next_on_path(u, v));
-      assert(tl.kth_path(u, v, dist_in_edges - 1) ==
-        lc.next_on_path(v, u));
-      assert(
-        lin_kth_path.kth_path(u, v, dist_in_edges - 1) ==
-        lc.next_on_path(v, u));
-      assert(tl.kth_path(u, v, dist_in_edges) == v);
-      assert(
-        lin_kth_path.kth_path(u, v, dist_in_edges) == v);
-      assert(tl.kth_path(u, v, dist_in_edges + 1) == -1);
-      assert(lin_kth_path.kth_path(u, v,
-               dist_in_edges + 1) == -1);
+      assert(tl.kth_path(u, v, 1) == lc.next_on_path(u, v));
+      assert(tl.kth_path(u, v, dist_in_edges - 1) == lc.next_on_path(v, u));
     }
   }
 }