compile fixes

Author: lrvideckis

library/trees/lca_rmq.hpp

@@ -1,6 +1,6 @@
 #pragma once
-#include "../../monotonic_stack/monotonic_stack.hpp"
-#include "../../data_structures/rmq.hpp"
+#include "../monotonic_stack/monotonic_stack.hpp"
+#include "../data_structures/rmq.hpp"
 //! https://github.com/kth-competitive-programming/kactl/blob/main/content/graph/LCA.h
 //! @code
 //!   {
@@ -36,9 +36,9 @@ struct LCA {
     auto [x, y] = minmax(tin[u], tin[v]);
     return p[rmq.query(x + 1, y + 1)];
   }
-#include "../extra_members/dist_edges.hpp"
-#include "../extra_members/in_subtree.hpp"
-#include "../extra_members/on_path.hpp"
-#include "next_on_path.hpp"
-#include "../extra_members/virtual_tree.hpp"
+#include "extra_members/dist.hpp"
+#include "extra_members/in_subtree.hpp"
+#include "extra_members/on_path.hpp"
+#include "extra_members/next_on_path.hpp"
+#include "extra_members/virtual_tree.hpp"
 };

library/trees/linear_lca.hpp

@@ -41,5 +41,5 @@ struct linear_lca {
     }
     return d[u] < d[v] ? u : v;
   }
-#include "extra_members/dist_edges.hpp"
+#include "extra_members/dist.hpp"
 };

tests/library_checker_aizu_tests/trees/count_paths_per_length.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/frequency_table_of_tree_distance"
 #include "../template.hpp"
-#include "../../../library/trees/centroid_decomp_uncommon/count_paths_per_length.hpp"
+#include "../../../library/trees/uncommon/count_paths_per_length.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n;

tests/library_checker_aizu_tests/trees/edge_cd_contour_range_query.test.cpp

@@ -2,7 +2,7 @@
   "https://judge.yosupo.jp/problem/vertex_add_range_contour_sum_on_tree"
 #include "../template.hpp"
 #include "../edge_cd_asserts.hpp"
-#include "../../../library/trees/edge_centroid_decomp_uncommon/contour_range_query.hpp"
+#include "../../../library/trees/uncommon/contour_range_query.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;

tests/library_checker_aizu_tests/trees/edge_cd_contour_range_update.test.cpp

@@ -2,7 +2,7 @@
   "https://judge.yosupo.jp/problem/vertex_get_range_contour_add_on_tree"
 #include "../template.hpp"
 #include "../edge_cd_asserts.hpp"
-#include "../../../library/trees/edge_centroid_decomp_uncommon/contour_range_update.hpp"
+#include "../../../library/trees/uncommon/contour_range_update.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;

tests/library_checker_aizu_tests/trees/edge_cd_count_paths_per_length.test.cpp

@@ -2,7 +2,7 @@
   "https://judge.yosupo.jp/problem/frequency_table_of_tree_distance"
 #include "../template.hpp"
 #include "../edge_cd_asserts.hpp"
-#include "../../../library/trees/edge_centroid_decomp_uncommon/count_paths_per_length.hpp"
+#include "../../../library/trees/uncommon/count_paths_per_length.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n;

tests/library_checker_aizu_tests/trees/kth_path_ladder.test.cpp

@@ -1,8 +1,8 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/jump_on_tree"
 #include "../template.hpp"
-#include "../../../library/trees/ladder_decomposition/ladder_decomposition.hpp"
-#include "../../../library/trees/ladder_decomposition/linear_kth_par.hpp"
+#include "../../../library/trees/uncommon/ladder_decomposition.hpp"
+#include "../../../library/trees/linear_kth_par.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;

tests/library_checker_aizu_tests/trees/kth_path_linear.test.cpp

@@ -2,8 +2,8 @@
   "https://judge.yosupo.jp/problem/jump_on_tree"
 #include "../template.hpp"
 #include "../../../library/trees/linear_lca.hpp"
-#include "../../../library/trees/ladder_decomposition/linear_kth_par.hpp"
-#include "../../../library/trees/lca_rmq/lca_rmq.hpp"
+#include "../../../library/trees/linear_kth_par.hpp"
+#include "../../../library/trees/lca_rmq.hpp"
 #include "../compress_tree_asserts.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);