util/generalsegtree.hpp

• View this file on GitHub
• Last update: 2025-05-09 08:11:48+00:00
• Include: #include "util/generalsegtree.hpp"

Depends on

• structure/segtree.hpp

Verified with

• verify/aizu-DSL_2_A.test.cpp
• verify/yosupo-static_range_sum.test.cpp

Code

#pragma once
#include "segtree"
#include <bits/stdc++.h>
using namespace std;
using rangesum_int=segtree<int,[](int a,int b)->int{return a+b;},[]()->int{return 0;}>;
using rangesum_ll=segtree<long long,[](long long a,long long b)->long long{return a+b;},[]()->long long{return 0LL;}>;
using rangemin_int=segtree<int,[](int a,int b)->int{return min(a,b);},[]()->int{return numeric_limits<int>::max();}>;
using rangemin_ll=segtree<long long,[](long long a,long long b)->long long{return min(a,b);},[]()->long long{return numeric_limits<long long>::max();}>;
using rangemax_int=segtree<int,[](int a,int b)->int{return max(a,b);},[]()->int{return numeric_limits<int>::min();}>;
using rangemax_ll=segtree<long long,[](long long a,long long b)->long long{return max(a,b);},[]()->long long{return numeric_limits<long long>::min();}>;

#line 2 "structure/segtree.hpp"
#include<bits/stdc++.h>
using namespace std;
// op(op(a, b), c) = op(a, op(b, c)) が成り立つ必要がある(結合律)
template<class S, auto op, auto e>
struct segtree {
    int _n, size;
    vector<S> data;
    // 大きさn のセグ木を構築 O(n)
    segtree(int n) : _n(n) { build(vector<S>(n, e())); }
    // 大きさv.size() のセグ木を構築 O(n)
    segtree(vector<S>& v) : _n(v.size()) { build(v); }
    void build(vector<S> v) {
        size = __bit_ceil((unsigned int)_n);
        data.assign(2 * size, e());
        for (int i=0; i<_n; i++) data[size+i] = v[i];
        for (int i=size-1; 0<i; i--) update(i);
    }
    // p 番目の要素をx にする O(log n)
    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        data[p] = x;
        for (p>>=1; 0<p; p>>=1) update(p);
    }
    // p 番目の要素を取得する O(1)
    S get(int p) {
        assert(0 <= p && p < _n);
        return data[size+p];
    }
    // p 番目の要素を取得する O(1)
    S operator[](int p) {
        return get(p);
    }
    // [l, r) の区間クエリに答える O(log n)
    S prod(int l, int r) {
        assert(0 <= l && l <= r && r <= _n);
        S ll = e(), rr = e();
        l += size;
        r += size;
        while (l < r) {
            if (l & 1) ll = op(ll, data[l++]);
            if (r & 1) rr = op(data[--r], rr);
            l >>= 1;
            r >>= 1;
        }
        return op(ll, rr);
    }
    // [0, _n) のクエリに答える O(1)
    S all_prod() {
        return data[1];
    }
    // [0, _n) の区間の値を取得する O(n)
    vector<S> values() {
        vector<S> re(_n);
        for (int i=0; i<_n; i++) re[i] = data[size+i];
        return re;
    }
    void update(int p) {
        data[p] = op(data[2*p], data[2*p+1]);
    }
    // f(op([l, r)))=true となる最大のr を返す O(log n)
    template <class F>
    int max_right(int l, F f) {
        assert(f(e()));
        assert(0 <= l && l <= _n);
        if (l == _n) return l;
        l += size;
        S s = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(s, data[l]))) {
                while (l < size) {
                    l = 2 * l;
                    if (f(op(s, data[l]))) s = op(s, data[l++]);
                }
                return l - size;
            }
            s = op(s, data[l]);
            l++;
        } while (l != (l & -l));
        return _n;
    }
    // f(op([l, r)))=true となる最小のl を返す O(log n)
    template <class F>
    int min_left(int r, F f) {
        assert(f(e()));
        assert(0 <= r && r <= _n);
        if (r == 0) return r;
        r += size;
        S s = e();
        do {
            r--;
            while (r % 2 == 1) r >>= 1;
            if (!f(op(data[r], s))) {
                while (r < size) {
                    r = 2 * r + 1;
                    if (f(op(data[r], s))) s = op(data[r--], s);
                }
                return (r + 1) - size;
            }
            s = op(data[r], s);
        } while(r != (r & -r));
        return 0;
    }
};
#line 4 "util/generalsegtree.hpp"
using namespace std;
using rangesum_int=segtree<int,[](int a,int b)->int{return a+b;},[]()->int{return 0;}>;
using rangesum_ll=segtree<long long,[](long long a,long long b)->long long{return a+b;},[]()->long long{return 0LL;}>;
using rangemin_int=segtree<int,[](int a,int b)->int{return min(a,b);},[]()->int{return numeric_limits<int>::max();}>;
using rangemin_ll=segtree<long long,[](long long a,long long b)->long long{return min(a,b);},[]()->long long{return numeric_limits<long long>::max();}>;
using rangemax_int=segtree<int,[](int a,int b)->int{return max(a,b);},[]()->int{return numeric_limits<int>::min();}>;
using rangemax_ll=segtree<long long,[](long long a,long long b)->long long{return max(a,b);},[]()->long long{return numeric_limits<long long>::min();}>;

Back to top page