more fixes

Author: lrvideckis

tests/library_checker_aizu_tests/data_structures/deque_op.test.cpp

@@ -2,7 +2,7 @@
   "https://judge.yosupo.jp/problem/deque_operate_all_composite"
 #include "../template.hpp"
 #include "../../../library/contest/random.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);
   const int mod = 998'244'353;

tests/library_checker_aizu_tests/data_structures/dsu.test.cpp

@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/unionfind"
 #include "../template.hpp"
-#include "../../../library/data_structures/dsu/dsu.hpp"
+#include "../../../library/dsu/dsu.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;

tests/library_checker_aizu_tests/data_structures/dsu_bipartite.test.cpp

@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/unionfind"
 #include "../template.hpp"
-#include "../../../library/data_structures/dsu/dsu_bipartite.hpp"
+#include "../../../library/dsu/dsu_bipartite.hpp"
 #include "../../../library/contest/random.hpp"
 vector<bool> bipartite_check(
   const vector<vector<int>>& adj) {

tests/library_checker_aizu_tests/data_structures/kth_smallest_wavelet_matrix.test.cpp

@@ -1,7 +1,7 @@
 #define PROBLEM \
   "https://judge.yosupo.jp/problem/range_kth_smallest"
 #include "../template.hpp"
-#include "../../../library/data_structures/seg_tree_uncommon/wavelet_matrix.hpp"
+#include "../../../library/data_structures_[l,r)/seg_tree_uncommon/wavelet_matrix.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;

tests/library_checker_aizu_tests/data_structures/lazy_segment_tree.test.cpp

@@ -1,7 +1,7 @@
 #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.hpp"
+#include "../../../library/data_structures_[l,r)/lazy_seg_tree.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   {

tests/library_checker_aizu_tests/data_structures/permutation_tree.test.cpp

@@ -2,7 +2,7 @@
   "https://judge.yosupo.jp/problem/common_interval_decomposition_tree"
 #include "../template.hpp"
 #include "../perm_tree_asserts.hpp"
-#include "../../../library/data_structures/uncommon/permutation_tree.hpp"
+#include "../../../library/data_structures_[l,r)/uncommon/permutation_tree.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n;

tests/library_checker_aizu_tests/data_structures/persistent_seg_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/persistent.hpp"
+#include "../../../library/data_structures_[l,r)/seg_tree_uncommon/persistent.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;

tests/library_checker_aizu_tests/data_structures/rmq_linear.test.cpp

@@ -1,6 +1,6 @@
 #define PROBLEM "https://judge.yosupo.jp/problem/staticrmq"
 #include "../template.hpp"
-#include "../../../library/data_structures/uncommon/linear_rmq.hpp"
+#include "../../../library/data_structures_[l,r]/linear_rmq.hpp"
 int main() {
   cin.tie(0)->sync_with_stdio(0);
   int n, q;