fix

Author: lrvideckis

library/trees/tree_lift.hpp

@@ -37,5 +37,5 @@ struct tree_lift {
       else u = p[u], v = p[v];
     return u;
   }
-#include "../extra_members/dist_edges.hpp"
+#include "extra_members/dist.hpp"
 };

tests/library_checker_aizu_tests/trees/lca_all_methods_lib_checker.test.cpp

@@ -1,9 +1,9 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/lca"
 #include "../template.hpp"
 #include "../../../library/monotonic_stack/monotonic_stack.hpp"
-#include "../../../library/trees/tree_lift/tree_lift.hpp"
+#include "../../../library/trees/tree_lift.hpp"
 #include "../../../library/trees/linear_lca.hpp"
-#include "../../../library/trees/lca_rmq/lca_rmq.hpp"
+#include "../../../library/trees/lca_rmq.hpp"
 #include "../compress_tree_asserts.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
@@ -24,8 +24,8 @@ int main() {
     assert(lc.lca(i, i) == i);
     assert(lc.in_subtree(i, i));
     assert(lin_lca.lca(i, i) == i);
-    assert(lc.in[lc.rmq.dp[0][i]] == i &&
-      lc.rmq.dp[0][lc.in[i]] == i);
+    assert(lc.tin[lc.rmq.dp[0][i]] == i &&
+      lc.rmq.dp[0][lc.tin[i]] == i);
   }
   while (q--) {
     int u, v;