more fixes

lrvideckis · lrvideckis · commit f003f01ef505 · 2026-01-17T14:54:52.000-07:00
diff --git a/library/data_structures_[l,r)/lazy_seg_tree.hpp b/library/data_structures_[l,r)/lazy_seg_tree.hpp
@@ -1,5 +1,5 @@
 #pragma once
-#include "lazy_seg_tree_midpoint.hpp"
+#include "seg_tree_midpoint.hpp"
 ll op(ll vl, ll vr) { return vl + vr; }
 struct seg_tree {
   int n;
diff --git a/library/data_structures_[l,r]/bit.hpp b/library/data_structures_[l,r]/bit.hpp
@@ -5,7 +5,7 @@
 struct BIT {
   vector<ll> s;
   BIT(int n): s(n) {}
-#include "bit_uncommon/vector_constructor.hpp"
+#include "../data_structures_[l,r)/bit_uncommon/vector_constructor.hpp"
   void update(int i, ll d) {
     for (; i < sz(s); i |= i + 1) s[i] += d;
   }
@@ -17,5 +17,5 @@ struct BIT {
   ll query(int l, int r) { // [l, r]
     return query(r) - query(l - 1);
   }
-#include "bit_uncommon/walk.hpp"
+#include "../data_structures_[l,r)/bit_uncommon/walk.hpp"
 };
diff --git a/tests/library_checker_aizu_tests/data_structures/binary_trie.test.cpp b/tests/library_checker_aizu_tests/data_structures/binary_trie.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/set_xor_min"
 #include "../template.hpp"
-#include "../../../library/data_structures/binary_trie.hpp"
+#include "../../../library/strings/binary_trie.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int q;
diff --git a/tests/library_checker_aizu_tests/data_structures/bit.test.cpp b/tests/library_checker_aizu_tests/data_structures/bit.test.cpp
@@ -2,9 +2,9 @@
   "https://judge.yosupo.jp/problem/point_add_range_sum"
 #include "../template.hpp"
 #include "../../../library/contest/random.hpp"
-#include "../../../library/data_structures/bit_uncommon/rupq.hpp"
-#include "../../../library/data_structures/bit_uncommon/rurq.hpp"
-#include "../../../library/data_structures/lazy_seg_tree.hpp"
+#include "../../../library/data_structures_[l,r)/bit_uncommon/rupq.hpp"
+#include "../../../library/data_structures_[l,r)/bit_uncommon/rurq.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/bit_ordered_set.test.cpp b/tests/library_checker_aizu_tests/data_structures/bit_ordered_set.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/ordered_set"
 #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;
@@ -18,7 +18,7 @@ int main() {
   }
   ranges::sort(compress);
   compress.erase(unique(all(compress)), end(compress));
-  bit_inc bit(ssize(compress));
+  BIT bit(ssize(compress));
   auto get_compressed_idx = [&](int val) -> int {
     int l = 0, r = ssize(compress);
     while (l + 1 < r) {
diff --git a/tests/library_checker_aizu_tests/data_structures/bit_rupq.test.cpp b/tests/library_checker_aizu_tests/data_structures/bit_rupq.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=DSL_2_E"
 #include "../template.hpp"
-#include "../../../library/data_structures/bit_uncommon/rupq.hpp"
+#include "../../../library/data_structures_[l,r)/bit_uncommon/rupq.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
diff --git a/tests/library_checker_aizu_tests/data_structures/distinct_query.test.cpp b/tests/library_checker_aizu_tests/data_structures/distinct_query.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/static_range_count_distinct"
 #include "../template.hpp"
-#include "../../../library/data_structures/seg_tree_uncommon/distinct_query.hpp"
+#include "../../../library/data_structures_[l,r)/seg_tree_uncommon/distinct_query.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
diff --git a/tests/library_checker_aizu_tests/data_structures/dsu_restorable.test.cpp b/tests/library_checker_aizu_tests/data_structures/dsu_restorable.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/persistent_unionfind"
 #include "../template.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, q;
diff --git a/tests/library_checker_aizu_tests/data_structures/kruskal_tree_aizu.test.cpp b/tests/library_checker_aizu_tests/data_structures/kruskal_tree_aizu.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://onlinejudge.u-aizu.ac.jp/problems/ALDS1_12_A"
 #include "../template.hpp"
-#include "../../../library/data_structures/dsu/kruskal_tree.hpp"
+#include "../../../library/dsu/kruskal_tree.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n;
diff --git a/tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_constructor.test.cpp b/tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_constructor.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/point_add_range_sum"
 #include "../template.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);
   {
diff --git a/tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_inc.test.cpp b/tests/library_checker_aizu_tests/data_structures/lazy_segment_tree_inc.test.cpp
@@ -1,12 +1,12 @@
 #define PROBLEM \
   "https://onlinejudge.u-aizu.ac.jp/courses/library/3/DSL/all/DSL_2_G"
 #include "../template.hpp"
-#include "../../../library/data_structures/lazy_seg_tree_inc.hpp"
+#include "../../../library/data_structures_[l,r]/lazy_seg_tree.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
   cin >> n >> q;
-  seg_tree_inc st(n);
+  seg_tree st(n);
   while (q--) {
     int type, l, r;
     cin >> type >> l >> r;
diff --git a/tests/library_checker_aizu_tests/data_structures/line_tree_aizu.test.cpp b/tests/library_checker_aizu_tests/data_structures/line_tree_aizu.test.cpp
@@ -1,8 +1,8 @@
 #define PROBLEM \
   "https://onlinejudge.u-aizu.ac.jp/problems/ALDS1_12_A"
 #include "../template.hpp"
-#include "../../../library/data_structures/dsu/line_tree.hpp"
-#include "../../../library/data_structures/rmq.hpp"
+#include "../../../library/dsu/line_tree.hpp"
+#include "../../../library/data_structures_[l,r)/rmq.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n;
diff --git a/tests/library_checker_aizu_tests/data_structures/line_tree_lib_checker.test.cpp b/tests/library_checker_aizu_tests/data_structures/line_tree_lib_checker.test.cpp
@@ -1,8 +1,8 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/minimum_spanning_tree"
 #include "../template.hpp"
-#include "../../../library/data_structures/dsu/line_tree.hpp"
-#include "../../../library/data_structures/dsu/kruskal_tree.hpp"
+#include "../../../library/dsu/line_tree.hpp"
+#include "../../../library/dsu/kruskal_tree.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, m;
diff --git a/tests/library_checker_aizu_tests/data_structures/mode_query.test.cpp b/tests/library_checker_aizu_tests/data_structures/mode_query.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/static_range_mode_query"
 #include "../template.hpp"
-#include "../../../library/data_structures/uncommon/mode_query.hpp"
+#include "../../../library/data_structures_[l,r)/uncommon/mode_query.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
diff --git a/tests/library_checker_aizu_tests/data_structures/persistent_queue_tree.test.cpp b/tests/library_checker_aizu_tests/data_structures/persistent_queue_tree.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/persistent_queue"
 #include "../template.hpp"
-#include "../../../library/data_structures/seg_tree_uncommon/persistent.hpp"
+#include "../../../library/data_structures_[l,r)/seg_tree_uncommon/persistent.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int q;
diff --git a/tests/library_checker_aizu_tests/data_structures/pq_ds_undo_sliding_window.test.cpp b/tests/library_checker_aizu_tests/data_structures/pq_ds_undo_sliding_window.test.cpp
@@ -4,7 +4,7 @@
 // operations to be O(n)
 #undef _GLIBCXX_DEBUG
 #include "../template.hpp"
-#include "../../../library/data_structures/uncommon/priority_queue_of_updates.hpp"
+#include "../../../library/data_structures_[l,r)/uncommon/priority_queue_of_updates.hpp"
 struct stack_with_get_max {
   vector<pair<int, int>> st;
   void join(int val) {
diff --git a/tests/library_checker_aizu_tests/data_structures/pq_ds_undo_with_dsu.test.cpp b/tests/library_checker_aizu_tests/data_structures/pq_ds_undo_with_dsu.test.cpp
@@ -4,8 +4,8 @@
 // operations to be O(n)
 #undef _GLIBCXX_DEBUG
 #include "../template.hpp"
-#include "../../../library/data_structures/dsu/dsu_restorable.hpp"
-#include "../../../library/data_structures/uncommon/priority_queue_of_updates.hpp"
+#include "../../../library/dsu/dsu_restorable.hpp"
+#include "../../../library/data_structures_[l,r)/uncommon/priority_queue_of_updates.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
diff --git a/tests/library_checker_aizu_tests/data_structures/rmq_sparse_table.test.cpp b/tests/library_checker_aizu_tests/data_structures/rmq_sparse_table.test.cpp
@@ -1,7 +1,7 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"
 #include "../template.hpp"
 #include "../mono_st_asserts.hpp"
-#include "../../../library/data_structures/rmq.hpp"
+#include "../../../library/data_structures_[l,r)/rmq.hpp"
 int mn(int x, int y) { return min(x, y); }
 int main() {
   cin.tie(0)->sync_with_stdio(0);
diff --git a/tests/library_checker_aizu_tests/data_structures/rmq_sparse_table_inc.test.cpp b/tests/library_checker_aizu_tests/data_structures/rmq_sparse_table_inc.test.cpp
@@ -1,13 +1,13 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"
 #include "../template.hpp"
-#include "../../../library/data_structures/rmq_inc.hpp"
+#include "../../../library/data_structures_[l,r]/rmq.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
   cin >> n >> q;
   vector<int> a(n);
   for (int i = 0; i < n; i++) cin >> a[i];
-  rmq_inc rmq(a, ranges::min);
+  RMQ rmq(a, ranges::min);
   while (q--) {
     int l, r;
     cin >> l >> r;
diff --git a/tests/library_checker_aizu_tests/data_structures/simple_tree_inc.test.cpp b/tests/library_checker_aizu_tests/data_structures/simple_tree_inc.test.cpp
@@ -6,7 +6,7 @@ int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;
   cin >> n >> q;
-  tree_inc st(n, int{}, ranges::min);
+  tree st(n, int{}, ranges::min);
   rep(i, 0, n) st.update(i, INT_MAX);
   while (q--) {
     int type;

Original file line number	Diff line number	Diff line change
`@@ -1,7 +1,7 @@`
`1`	`1`	`#define PROBLEM \`
`2`	`2`	`"https://judge.yosupo.jp/problem/point_add_range_sum"`
`3`	`3`	`#include "../template.hpp"`
`4`		`-#include "../../../library/data_structures/lazy_seg_tree.hpp"`
	`4`	`+#include "../../../library/data_structures_[l,r)/lazy_seg_tree.hpp"`
`5`	`5`	`int main() {`
`6`	`6`	`cin.tie(0)->sync_with_stdio(0);`
`7`	`7`	`{`