fix

Author: lrvideckis

library/math/count_paths/count_paths_triangle.hpp

@@ -6,7 +6,7 @@
 vl divide_and_conquer(vl h, vl bottom) {
   {
     int start =
-      find_if(all(h), [](ll x) { return x; }) - begin(h);
+        ranges::find_if(h, [](ll x) { return x; }) - begin(h);
     h.erase(begin(h), begin(h) + start);
     bottom.erase(begin(bottom), begin(bottom) + start);
   }
@@ -15,10 +15,10 @@ vl divide_and_conquer(vl h, vl bottom) {
   if (n == 1) return vl(h[0], bottom[0]);
   int mid = n / 2;
   auto rect_left =
-    divide_and_conquer(vl(begin(h), begin(h) + mid),
-      vl(begin(bottom), begin(bottom) + mid));
+      divide_and_conquer(vl(begin(h), begin(h) + mid),
+                         vl(begin(bottom), begin(bottom) + mid));
   auto [rect_right, rect_top] =
-    get_right_and_top(rect_left, vl(mid + all(bottom)));
+      get_right_and_top(rect_left, vl(mid + all(bottom)));
   vl h_right(mid + all(h));
   for (ll& hh : h_right) hh -= h[mid - 1];
   auto upper_right = divide_and_conquer(h_right, rect_top);

tests/library_checker_aizu_tests/data_structures/range_parallel_dsu.test.cpp

@@ -1,5 +1,6 @@
 #define PROBLEM \
   "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"
@@ -22,13 +23,14 @@ int main() {
     x[u] = x[u] + x[v];
   };
   vector<array<int, 3>> queries;
+  queries.reserve(q);
   for (int qq = 0; qq < q; qq++) {
     int k, a, b;
     cin >> k >> a >> b;
     dsu.join(a, b, k, f);
     queries.push_back({a, b, k});
     cout << ans.x << '\n';
-    if (qq < 3 || abs(q - qq) <= 3 || qq % 100'000 == 0) {
+    if (qq == 0 || qq == 1 || qq == 10 || qq == 1000 || qq == 100'000 || qq == q - 1) {
       auto uf = get_rp_dsu(queries, n);
       vector<mint> sums(n);
       mint offline_ans = 0;