Merge branch 'dev' into golf

Author: lrvideckis

.verify-helper/timestamps.remote.json

@@ -43,11 +43,6 @@
 "tests/library_checker_aizu_tests/data_structures/rmq_linear.test.cpp": "2026-01-18 11:15:41 +0000",
 "tests/library_checker_aizu_tests/data_structures/rmq_sparse_table.test.cpp": "2026-01-18 11:15:41 +0000",
 "tests/library_checker_aizu_tests/data_structures/rmq_sparse_table_inc.test.cpp": "2026-01-18 11:15:41 +0000",
-"tests/library_checker_aizu_tests/data_structures/simple_tree.test.cpp": "2026-01-28 21:53:13 -0700",
-"tests/library_checker_aizu_tests/data_structures/simple_tree_inc.test.cpp": "2026-02-07 17:15:13 -0700",
-"tests/library_checker_aizu_tests/data_structures/simple_tree_inc_line.test.cpp": "2026-02-07 17:15:13 -0700",
-"tests/library_checker_aizu_tests/data_structures/simple_tree_inc_walk.test.cpp": "2026-02-07 17:42:33 -0700",
-"tests/library_checker_aizu_tests/data_structures/simple_tree_line.test.cpp": "2026-01-28 21:53:13 -0700",
 "tests/library_checker_aizu_tests/flow/dinic_aizu.test.cpp": "2024-11-17 14:04:03 -0600",
 "tests/library_checker_aizu_tests/flow/hungarian.test.cpp": "2024-11-17 14:04:03 -0600",
 "tests/library_checker_aizu_tests/flow/min_cost_max_flow.test.cpp": "2024-12-05 10:41:42 -0600",

library/data_structures_[l,r)/seg_tree.hpp

@@ -1,10 +1,14 @@
 #pragma once
 //! https://github.com/kth-competitive-programming/kactl/blob/main/content/data-structures/SegmentTree.h
+//! https://codeforces.com/blog/entry/118682
 //! @code
 //!   tree st1(n, INT_MAX, ranges::min);
 //!   tree st2(n, INT_MAX, [&](int x, int y) -> int {
 //!     return min(x, y);
 //!   });
+//!   int idx = st2.walk(l, r, [&](int value) {
+//!     return value > x;
+//!   }); // min idx in [l, r) such that f is false
 //! @endcode
 //! @time O(n + q log n)
 //! @space O(n)
@@ -27,4 +31,5 @@ template<class T, class F> struct tree {
     }
     return op(x, y);
   }
+#include "seg_tree_uncommon/walk.hpp"
 };

library/data_structures_[l,r)/seg_tree_uncommon/walk.hpp

@@ -0,0 +1,8 @@
+int walk(int l, int r, const auto& f) {
+  while (l < r) {
+    int u = l + n, x = __lg(min(u & -u, r - l));
+    if (f(s[u >> x])) l += 1 << x;
+    else r = l + (1 << x) - 1;
+  }
+  return l;
+}

tests/library_checker_aizu_tests/data_structures/simple_tree_walk.test.cpp

@@ -0,0 +1,44 @@
+#define PROBLEM \
+  "https://judge.yosupo.jp/problem/predecessor_problem"
+#include "../template.hpp"
+#include "../../../library/data_structures_[l,r)/seg_tree.hpp"
+int main() {
+  cin.tie(0)->sync_with_stdio(0);
+  int n, q;
+  cin >> n >> q;
+  tree st(n, 0, plus<int>{});
+  string s;
+  cin >> s;
+  for (int i = 0; i < n; i++) st.update(i, s[i] - '0');
+  while (q--) {
+    int type, k;
+    cin >> type >> k;
+    if (type == 0) {
+      if (st.query(k, k + 1) == 0) st.update(k, 1);
+    } else if (type == 1) {
+      if (st.query(k, k + 1) == 1) st.update(k, 0);
+    } else if (type == 2) {
+      cout << st.query(k, k + 1) << '\n';
+    } else if (type == 3) {
+      // returns first element in [k,n) such that sum > 0
+      int idx =
+        st.walk(k, n, [&](int sum) { return sum == 0; });
+      if (idx == n) idx = -1;
+      cout << idx << '\n';
+    } else {
+      assert(type == 4);
+      int total = st.query(0, k + 1);
+      if (total == 0) {
+        cout << -1 << '\n';
+      } else {
+        int pref_sum = 0;
+        cout << st.walk(0, k + 1, [&](int sum) {
+          if (pref_sum + sum < total)
+            return pref_sum += sum, 1;
+          return 0;
+        }) << '\n';
+      }
+    }
+  }
+  return 0;
+}