fix

lrvideckis · lrvideckis · commit ae2c457a9388 · 2026-01-17T15:07:54.000-07:00
diff --git a/library/graphs/mst.hpp b/library/graphs/mst.hpp
@@ -1,5 +1,5 @@
 #pragma once
-#include "../data_structures/dsu/dsu.hpp"
+#include "../dsu/dsu.hpp"
 //! @code
 //!   auto [mst_cost, ids] = mst(w_eds, n);
 //! @endcode
diff --git a/library/strings/manacher/longest_palindrome_query.hpp b/library/strings/manacher/longest_palindrome_query.hpp
@@ -1,5 +1,5 @@
 #pragma once
-#include "../../data_structures/rmq.hpp"
+#include "../../data_structures_[l,r)/rmq.hpp"
 #include "manacher.hpp"
 //! queries for longest palindromic substring of a given
 //! substring
diff --git a/library/trees/lca_rmq.hpp b/library/trees/lca_rmq.hpp
@@ -1,6 +1,6 @@
 #pragma once
 #include "../monotonic_stack/monotonic_stack.hpp"
-#include "../data_structures/rmq.hpp"
+#include "../data_structures_[l,r)/rmq.hpp"
 //! https://github.com/kth-competitive-programming/kactl/blob/main/content/graph/LCA.h
 //! @code
 //!   vector<basic_string<int>> adj(n);
diff --git a/library/trees/uncommon/contour_range_query.hpp b/library/trees/uncommon/contour_range_query.hpp
@@ -1,5 +1,5 @@
 #pragma once
-#include "../../data_structures/bit.hpp"
+#include "../../data_structures_[l,r)/bit.hpp"
 #include "../edge_cd.hpp"
 #include "sum_adjacent.hpp"
 //! https://judge.yosupo.jp/problem/vertex_add_range_contour_sum_on_tree
diff --git a/library/trees/uncommon/contour_range_update.hpp b/library/trees/uncommon/contour_range_update.hpp
@@ -1,5 +1,5 @@
 #pragma once
-#include "../../data_structures/bit_uncommon/rupq.hpp"
+#include "../../data_structures_[l,r)/bit_uncommon/rupq.hpp"
 #include "../edge_cd.hpp"
 #include "sum_adjacent.hpp"
 //! https://judge.yosupo.jp/problem/vertex_get_range_contour_add_on_tree
diff --git a/tests/library_checker_aizu_tests/data_structures/bit_inc.test.cpp b/tests/library_checker_aizu_tests/data_structures/bit_inc.test.cpp
@@ -1,12 +1,12 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/point_add_range_sum"
 #include "../template.hpp"
-#include "../../../library/data_structures/bit_inc.hpp"
+#include "../../../library/data_structures_[l,r]/bit.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
   cin >> n >> q;
-  bit_inc bit(n);
+  BIT bit(n);
   for (int i = 0; i < n; i++) {
     int val;
     cin >> val;
diff --git a/tests/library_checker_aizu_tests/data_structures/bit_rurq.test.cpp b/tests/library_checker_aizu_tests/data_structures/bit_rurq.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_G"
 #include "../template.hpp"
-#include "../../../library/data_structures/bit_uncommon/rurq.hpp"
+#include "../../../library/data_structures_[l,r)/bit_uncommon/rurq.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
diff --git a/tests/library_checker_aizu_tests/data_structures/bit_walk.test.cpp b/tests/library_checker_aizu_tests/data_structures/bit_walk.test.cpp
@@ -1,8 +1,8 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/predecessor_problem"
 #include "../template.hpp"
-#include "../../../library/data_structures/bit.hpp"
-#include "../../../library/data_structures/lazy_seg_tree.hpp"
+#include "../../../library/data_structures_[l,r)/bit.hpp"
+#include "../../../library/data_structures_[l,r)/lazy_seg_tree.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
diff --git a/tests/library_checker_aizu_tests/data_structures/deque.test.cpp b/tests/library_checker_aizu_tests/data_structures/deque.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://onlinejudge.u-aizu.ac.jp/courses/lesson/8/ITP2/all/ITP2_1_B"
 #include "../template.hpp"
-#include "../../../library/data_structures/uncommon/deque_op.hpp"
+#include "../../../library/data_structures_[l,r)/uncommon/deque_op.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int q;
diff --git a/tests/library_checker_aizu_tests/data_structures/deque_index.test.cpp b/tests/library_checker_aizu_tests/data_structures/deque_index.test.cpp
@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/deque"
 #include "../template.hpp"
-#include "../../../library/data_structures/uncommon/deque_op.hpp"
+#include "../../../library/data_structures_[l,r)/uncommon/deque_op.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int q;
diff --git a/tests/library_checker_aizu_tests/data_structures/dsu_segtree_undo_trick.test.cpp b/tests/library_checker_aizu_tests/data_structures/dsu_segtree_undo_trick.test.cpp
@@ -1,8 +1,8 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/dynamic_graph_vertex_add_component_sum"
 #include "../template.hpp"
-#include "../../../library/data_structures/dsu/dsu_restorable.hpp"
-#include "../../../library/data_structures/lazy_seg_tree.hpp"
+#include "../../../library//dsu/dsu_restorable.hpp"
+#include "../../../library/data_structures_[l,r)/lazy_seg_tree.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
diff --git a/tests/library_checker_aizu_tests/data_structures/merge_sort_tree.test.cpp b/tests/library_checker_aizu_tests/data_structures/merge_sort_tree.test.cpp
@@ -4,7 +4,7 @@
 // to `lower_bound`, causing TLE.
 #undef _GLIBCXX_DEBUG
 #include "../template.hpp"
-#include "../../../library/data_structures/seg_tree_uncommon/merge_sort_tree.hpp"
+#include "../../../library/data_structures_[l,r)/seg_tree_uncommon/merge_sort_tree.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
diff --git a/tests/library_checker_aizu_tests/data_structures/range_parallel_dsu.test.cpp b/tests/library_checker_aizu_tests/data_structures/range_parallel_dsu.test.cpp
@@ -2,8 +2,8 @@
   "https://judge.yosupo.jp/problem/range_parallel_unionfind"
 #undef _GLIBCXX_DEBUG
 #include "../template.hpp"
-#include "../../../library/data_structures/dsu/range_parallel_dsu.hpp"
-#include "../../../library/data_structures/dsu/range_parallel_equivalence_classes.hpp"
+#include "../../../library/dsu/range_parallel_dsu.hpp"
+#include "../../../library/dsu/range_parallel_equivalence_classes.hpp"
 const int mod = 998244353;
 int main() {
   cin.tie(0)->sync_with_stdio(0);
diff --git a/tests/library_checker_aizu_tests/data_structures/simple_tree.test.cpp b/tests/library_checker_aizu_tests/data_structures/simple_tree.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://onlinejudge.u-aizu.ac.jp/problems/DSL_2_A"
 #include "../template.hpp"
-#include "../../../library/data_structures/seg_tree.hpp"
+#include "../../../library/data_structures_[l,r)/seg_tree.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
diff --git a/tests/library_checker_aizu_tests/data_structures/simple_tree_line.test.cpp b/tests/library_checker_aizu_tests/data_structures/simple_tree_line.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/point_set_range_composite"
 #include "../template.hpp"
-#include "../../../library/data_structures/seg_tree.hpp"
+#include "../../../library/data_structures_[l,r)/seg_tree.hpp"
 const int mod = 998'244'353;
 int main() {
   cin.tie(0)->sync_with_stdio(0);
diff --git a/tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_two_cc.test.cpp b/tests/library_checker_aizu_tests/graphs/bcc_callback_lib_checker_two_cc.test.cpp
@@ -2,7 +2,7 @@
   "https://judge.yosupo.jp/problem/two_edge_connected_components"
 #include "../template.hpp"
 #include "../../../library/graphs/bcc_callback.hpp"
-#include "../../../library/data_structures/dsu/dsu.hpp"
+#include "../../../library/dsu/dsu.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
diff --git a/tests/library_checker_aizu_tests/graphs/offline_incremental_scc.test.cpp b/tests/library_checker_aizu_tests/graphs/offline_incremental_scc.test.cpp
@@ -2,7 +2,7 @@
   "https://judge.yosupo.jp/problem/incremental_scc"
 #include "../template.hpp"
 #include "../../../library/graphs/strongly_connected_components/offline_incremental_scc.hpp"
-#include "../../../library/data_structures/dsu/dsu.hpp"
+#include "../../../library/dsu/dsu.hpp"
 const int mod = 998244353;
 int main() {
   cin.tie(0)->sync_with_stdio(0);
diff --git a/tests/library_checker_aizu_tests/graphs/two_edge_components.test.cpp b/tests/library_checker_aizu_tests/graphs/two_edge_components.test.cpp
@@ -2,7 +2,7 @@
   "https://judge.yosupo.jp/problem/two_edge_connected_components"
 #include "../template.hpp"
 #include "../../../library/graphs/uncommon/bridge_tree.hpp"
-#include "../../../library/data_structures/dsu/dsu_restorable.hpp"
+#include "../../../library/dsu/dsu_restorable.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
diff --git a/tests/library_checker_aizu_tests/handmade_tests/dsu.test.cpp b/tests/library_checker_aizu_tests/handmade_tests/dsu.test.cpp
@@ -2,7 +2,7 @@
   "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A"
 #include "../template.hpp"
 #include "../../../library/contest/random.hpp"
-#include "../../../library/data_structures/dsu/dsu.hpp"
+#include "../../../library/dsu/dsu.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   for (int n = 0; n <= 100; n++) {
diff --git a/tests/library_checker_aizu_tests/handmade_tests/dsu_size.test.cpp b/tests/library_checker_aizu_tests/handmade_tests/dsu_size.test.cpp
@@ -2,7 +2,7 @@
   "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A"
 #include "../template.hpp"
 #include "../../../library/contest/random.hpp"
-#include "../../../library/data_structures/dsu/dsu_restorable.hpp"
+#include "../../../library/dsu/dsu_restorable.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   for (int n = 1; n < 100; n++) {
diff --git a/tests/library_checker_aizu_tests/handmade_tests/hilbert_mos.test.cpp b/tests/library_checker_aizu_tests/handmade_tests/hilbert_mos.test.cpp
@@ -2,7 +2,7 @@
   "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A"
 #include "../template.hpp"
 #include "../../../library/contest/random.hpp"
-#include "../../../library/data_structures/uncommon/hilbert_mos.hpp"
+#include "../../../library/data_structures_[l,r)/uncommon/hilbert_mos.hpp"
 const vector<int> di = {1, -1, 0, 0};
 const vector<int> dj = {0, 0, 1, -1};
 void test(int i, int j) {
diff --git a/tests/library_checker_aizu_tests/handmade_tests/merge_st_and_wavelet.test.cpp b/tests/library_checker_aizu_tests/handmade_tests/merge_st_and_wavelet.test.cpp
@@ -2,8 +2,8 @@
   "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A"
 #include "../template.hpp"
 #include "../../../library/contest/random.hpp"
-#include "../../../library/data_structures/seg_tree_uncommon/merge_sort_tree.hpp"
-#include "../../../library/data_structures/seg_tree_uncommon/wavelet_matrix.hpp"
+#include "../../../library/data_structures_[l,r)/seg_tree_uncommon/merge_sort_tree.hpp"
+#include "../../../library/data_structures_[l,r)/seg_tree_uncommon/wavelet_matrix.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   // brute force small cases
diff --git a/tests/library_checker_aizu_tests/handmade_tests/rmq_small_n.test.cpp b/tests/library_checker_aizu_tests/handmade_tests/rmq_small_n.test.cpp
@@ -2,21 +2,17 @@
   "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A"
 #include "../template.hpp"
 #include "../../../library/contest/random.hpp"
-#include "../../../library/data_structures/rmq.hpp"
-#include "../../../library/data_structures/uncommon/disjoint_rmq.hpp"
-#include "../../../library/data_structures/uncommon/linear_rmq.hpp"
+#include "../../../library/data_structures_[l,r)/rmq.hpp"
+#include "../../../library/data_structures_[l,r]/linear_rmq.hpp"
 void test_all_subarrays(const vector<int>& a) {
   auto n = sz(a);
   RMQ rmq(a, [](auto x, auto y) { return min(x, y); });
-  disjoint_rmq dis_rmq(a,
-    [](auto x, auto y) { return min(x, y); });
   linear_rmq lin_rmq(a, less());
   for (int l = 0; l < n; l++) {
     for (int r = l + 1; r <= n; r++) {
       int idx_min = lin_rmq.idx(l, r - 1);
       assert(l <= idx_min && idx_min < r);
       assert(a[idx_min] == rmq.query(l, r));
-      assert(a[idx_min] == dis_rmq.query(l, r));
     }
   }
 }
diff --git a/tests/library_checker_aizu_tests/handmade_tests/seg_tree_find.test.cpp b/tests/library_checker_aizu_tests/handmade_tests/seg_tree_find.test.cpp
@@ -2,8 +2,8 @@
   "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_1_A"
 #include "../template.hpp"
 #include "../../../library/contest/random.hpp"
-#include "../../../library/data_structures/bit.hpp"
-#include "../../../library/data_structures/lazy_seg_tree.hpp"
+#include "../../../library/data_structures_[l,r)/bit.hpp"
+#include "../../../library/data_structures_[l,r)/lazy_seg_tree.hpp"
 const int mx_n = 100'000;
 int rv(int i) { return mx_n - i - 1; }
 int main() {
diff --git a/tests/library_checker_aizu_tests/perm_tree_asserts.hpp b/tests/library_checker_aizu_tests/perm_tree_asserts.hpp
@@ -1,6 +1,6 @@
 #pragma once
-#include "../../library/data_structures/rmq.hpp"
-#include "../../library/data_structures/uncommon/permutation_tree.hpp"
+#include "../../library/data_structures_[l,r)/rmq.hpp"
+#include "../../library/data_structures_[l,r)/uncommon/permutation_tree.hpp"
 perm_tree perm_tree_asserts(const vector<int>& a) {
   int n = sz(a);
   perm_tree pt(a);
diff --git a/tests/library_checker_aizu_tests/trees/hld_aizu1.test.cpp b/tests/library_checker_aizu_tests/trees/hld_aizu1.test.cpp
@@ -2,7 +2,7 @@
   "https://onlinejudge.u-aizu.ac.jp/problems/GRL_5_D"
 #include "../template.hpp"
 #include "../../../library/trees/hld.hpp"
-#include "../../../library/data_structures/bit.hpp"
+#include "../../../library/data_structures_[l,r)/bit.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n;
diff --git a/tests/library_checker_aizu_tests/trees/hld_aizu2.test.cpp b/tests/library_checker_aizu_tests/trees/hld_aizu2.test.cpp
@@ -2,7 +2,7 @@
   "https://onlinejudge.u-aizu.ac.jp/problems/GRL_5_E"
 #include "../template.hpp"
 #include "../../../library/trees/hld.hpp"
-#include "../../../library/data_structures/lazy_seg_tree.hpp"
+#include "../../../library/data_structures_[l,r)/lazy_seg_tree.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n;
diff --git a/tests/library_checker_aizu_tests/trees/hld_lib_checker_path.test.cpp b/tests/library_checker_aizu_tests/trees/hld_lib_checker_path.test.cpp
@@ -2,7 +2,7 @@
   "https://judge.yosupo.jp/problem/vertex_add_path_sum"
 #include "../template.hpp"
 #include "../../../library/trees/hld.hpp"
-#include "../../../library/data_structures/bit.hpp"
+#include "../../../library/data_structures_[l,r)/bit.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
diff --git a/tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_edges.test.cpp b/tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_edges.test.cpp
@@ -2,7 +2,7 @@
   "https://judge.yosupo.jp/problem/vertex_add_subtree_sum"
 #include "../template.hpp"
 #include "../../../library/trees/hld.hpp"
-#include "../../../library/data_structures/bit.hpp"
+#include "../../../library/data_structures_[l,r)/bit.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
diff --git a/tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_nodes.test.cpp b/tests/library_checker_aizu_tests/trees/hld_lib_checker_subtree_nodes.test.cpp
@@ -2,7 +2,7 @@
   "https://judge.yosupo.jp/problem/vertex_add_subtree_sum"
 #include "../template.hpp"
 #include "../../../library/trees/hld.hpp"
-#include "../../../library/data_structures/bit.hpp"
+#include "../../../library/data_structures_[l,r)/bit.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
