Merge pull request #107 from rainbou-kpr/seg-assert

add assert to segtree

Author: KowerKoint

.verify-helper/timestamps.remote.json

@@ -8,9 +8,9 @@
 "test/aoj-cgl-3-c.test.cpp": "2023-09-07 23:01:33 +0900",
 "test/aoj-cgl-4-a.test.cpp": "2023-09-07 23:01:33 +0900",
 "test/aoj-cgl-5-a.test.cpp": "2023-09-07 23:01:33 +0900",
-"test/aoj-dsl-2-a.test.cpp": "2024-03-06 15:05:55 +0900",
+"test/aoj-dsl-2-a.test.cpp": "2024-03-11 22:28:50 +0900",
 "test/aoj-dsl-2-a.test.py": "2023-09-07 14:26:13 +0900",
-"test/aoj-dsl-2-b.test.cpp": "2024-03-06 15:05:55 +0900",
+"test/aoj-dsl-2-b.test.cpp": "2024-03-11 22:28:50 +0900",
 "test/aoj-dsl-2-b.test.py": "2023-09-07 14:26:13 +0900",
 "test/aoj-dsl-2-f.test.cpp": "2023-08-01 17:59:54 +0900",
 "test/aoj-dsl-2-g.test.cpp": "2023-08-01 17:59:54 +0900",
@@ -20,13 +20,13 @@
 "test/aoj-grl-5-b.test.cpp": "2023-06-16 15:41:49 +0900",
 "test/atcoder-abc177-f.1.test.cpp": "2023-08-01 17:59:54 +0900",
 "test/atcoder-abc177-f.2.test.cpp": "2023-08-01 17:59:54 +0900",
-"test/atcoder-abc185-f.test.cpp": "2024-03-06 15:05:55 +0900",
-"test/atcoder-abc254-f.test.cpp": "2024-03-06 15:05:55 +0900",
+"test/atcoder-abc185-f.test.cpp": "2024-03-11 22:28:50 +0900",
+"test/atcoder-abc254-f.test.cpp": "2024-03-11 22:28:50 +0900",
 "test/atcoder-abc282-d.test.cpp": "2023-11-30 23:29:28 +0900",
 "test/atcoder-abc300-b.test.cpp": "2023-10-12 08:50:40 +0900",
-"test/atcoder-abc331-f.test.cpp": "2024-03-06 18:33:07 +0900",
+"test/atcoder-abc331-f.test.cpp": "2024-03-11 22:28:50 +0900",
 "test/atcoder-edpc-g.test.cpp": "2023-11-30 23:29:28 +0900",
-"test/atcoder-past202012-n.test.cpp": "2024-03-06 15:05:55 +0900",
+"test/atcoder-past202012-n.test.cpp": "2024-03-11 22:28:50 +0900",
 "test/atcoder-past202012-n.test.py": "2023-09-07 14:26:13 +0900",
 "test/yosupo-binomial-coefficient.test.cpp": "2023-09-16 00:25:06 +0900",
 "test/yosupo-convolution-mod-1000000007.test.cpp": "2023-09-16 00:07:15 +0900",
@@ -38,14 +38,14 @@
 "test/yosupo-exp-of-fps.test.cpp": "2024-01-20 00:58:37 +0900",
 "test/yosupo-inv-of-fps.test.cpp": "2024-01-20 00:58:37 +0900",
 "test/yosupo-lca.1.test.cpp": "2023-06-16 15:41:49 +0900",
-"test/yosupo-lca.2.test.cpp": "2024-03-06 15:05:55 +0900",
+"test/yosupo-lca.2.test.cpp": "2024-03-11 22:28:50 +0900",
 "test/yosupo-line-add-get-min.test.cpp": "2023-06-19 07:11:52 +0900",
 "test/yosupo-log-of-fps.test.cpp": "2024-01-20 00:58:37 +0900",
 "test/yosupo-partition-function_1.test.cpp": "2024-01-20 00:58:37 +0900",
 "test/yosupo-partition-function_2.test.cpp": "2024-01-20 00:58:37 +0900",
 "test/yosupo-point-add-rectangle-sum.test.cpp": "2023-06-25 14:14:02 +0900",
-"test/yosupo-point-set-range-composite.1.test.cpp": "2024-03-06 15:05:55 +0900",
-"test/yosupo-point-set-range-composite.2.test.cpp": "2024-03-06 15:05:55 +0900",
+"test/yosupo-point-set-range-composite.1.test.cpp": "2024-03-11 22:28:50 +0900",
+"test/yosupo-point-set-range-composite.2.test.cpp": "2024-03-11 22:28:50 +0900",
 "test/yosupo-point-set-range-composite.test.py": "2023-09-07 14:26:13 +0900",
 "test/yosupo-polynomial-taylor-shift.test.cpp": "2024-01-20 00:58:37 +0900",
 "test/yosupo-pow-of-fps.test.cpp": "2024-01-20 00:58:37 +0900",

cpp/segtree.hpp

@@ -64,7 +64,10 @@ class SegTreeBase {
      * @param k インデックス
      * @return S 値
      */
-    S get(int k) const { return data[sz + k]; }
+    S get(int k) const {
+        assert(0 <= k && k < n);
+        return data[sz + k];
+    }
     /**
      * @brief 指定された要素の値を返す
      * 
@@ -105,6 +108,7 @@ class SegTreeBase {
      * @param x 新しい値
      */
     void set(int k, const S& x) {
+        assert(0 <= k && k < n);
         k += sz;
         data[k] = x;
         for (int i = 1; i <= height; i++) update(k >> i);
@@ -121,10 +125,11 @@ class SegTreeBase {
      * @brief [l, r)の区間の総積を返す
      * 
      * @param l 半開区間の開始
-     * @param r 半開区間の終端
+     * @param r 半開区間の終端 0<=l<=r<=n
      * @return S 総積
      */
     S prod(int l, int r) const {
+        assert(0 <= l && l <= r && r <= n);
         S left_prod = e(), right_prod = e();
         l += sz;
         r += sz;
@@ -148,13 +153,14 @@ class SegTreeBase {
      * fが単調なら、f(prod([l, r))) = trueとなる最大のr
      * 
      * @tparam F
-     * @param l 半開区間の開始
+     * @param l 半開区間の開始 0<=l<=n
      * @param f 判定関数 f(e) = true
      * @return int
      */
     template <typename F>
     int max_right(int l, F f) const {
         assert(f(e()));
+        assert(0 <= l && l <= n);
         if (l == n) return n;
         l += sz;
         while (l % 2 == 0) l >>= 1;
@@ -179,13 +185,14 @@ class SegTreeBase {
      * fが単調なら、f(prod([l, r))) = trueとなる最小のl
      * 
      * @tparam F
-     * @param r 半開区間の終端
+     * @param r 半開区間の終端 0<=r<=n
      * @param f 判定関数 f(e) = true
      * @return int
      */
     template <typename F>
     int min_left(int r, F f) const {
         assert(f(e()));
+        assert(0 <= r && r <= n);
         if (r == 0) return 0;
         r += sz;
         while (r % 2 == 0) r >>= 1;