fix buggy test

Author: lrvideckis

tests/library_checker_aizu_tests/handmade_tests/lca_ladder_forest.test.cpp

@@ -6,10 +6,8 @@
 #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/ladder_decomposition/ladder_decomposition.hpp"
 #include "../../../library/trees/ladder_decomposition/linear_kth_par.hpp"
-#include "../../../library/trees/linear_kth_path.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   for (int n = 1; n <= 100; n++) {
@@ -26,31 +24,20 @@ int main() {
     }
     tree_lift tl(adj);
     LCA lc(adj);
-    linear_lca lin_lca(adj);
     ladder lad(adj);
-    linear_kth_path lin_kth_path(adj);
     for (int i = 0; i < 100; i++) {
       int u = rnd<int>(0, n - 1);
       int v = rnd<int>(0, n - 1);
       if (u == v || !dsu.same_set(u, v)) continue;
       auto lca_1 = tl.lca(u, v);
       auto lca_2 = lc.lca(u, v);
-      auto lca_3 = lin_lca.lca(u, v);
       assert(lca_1 == lca_2);
-      assert(lca_1 == lca_3);
       assert(tl.dist_edges(u, v) == lc.dist_edges(u, v));
-      assert(
-        tl.dist_edges(u, v) == lin_lca.dist_edges(u, v));
       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));
       if (tl.t[u].d > tl.t[v].d) swap(u, v);
       auto res = tl.kth_par(v, tl.t[v].d - tl.t[u].d);
       assert(res == lad.kth_par(v, tl.t[v].d - tl.t[u].d));
-      assert(res ==
-        lin_kth_path.lin_kp.kth_par(v,
-          tl.t[v].d - tl.t[u].d));
       assert((u == res) == lc.in_subtree(u, v));
     }
   }