code-template/SegmentTree.cpp at master · renamoe/code-template · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
template<class Info,
    class Merge = std::plus<Info>>
struct SegmentTree {
private:
    const Merge merge;
    int n;
    std::vector<Info> f;

private:
    void modify(int u, int l, int r, int p, const Info &k) {
        if (r - l == 1) {
            f[u] = k;
            return;
        }
        int mid = (l + r) / 2;
        if (p < mid) {
            modify(u * 2, l, mid, p, k);
        } else {
            modify(u * 2 + 1, mid, r, p, k);
        }
        f[u] = merge(f[u * 2], f[u * 2 + 1]);
    }
    Info query(int u, int l, int r, int L, int R) {
        if (L <= l && r <= R) {
            return f[u];
        }
        int mid = (l + r) / 2;
        if (L >= mid) {
            return query(u * 2 + 1, mid, r, L, R);
        }
        if (R <= mid) {
            return query(u * 2, l, mid, L, R);
        }
        return merge(query(u * 2, l, mid, L, R), query(u * 2 + 1, mid, r, L, R));
    }

public:
    SegmentTree(int n) : merge(Merge()), n(n), f(n * 4) {}
    void modify(int p, const Info &k) {
        if (p < 0 || p >= n) return;
        modify(1, 0, n, p, k);
    }
    Info query(int l, int r) {
        if (l >= r) return Info();
        return query(1, 0, n, l, r);
    }
};


template<class Info, class Tag,
    class Merge = std::plus<Info>>
class LazySegmentTree {
private:
    const Merge merge;
    int n;
    std::vector<Info> f;
    std::vector<Tag> tag;

private:
    void update(int u) {
        f[u] = merge(f[u * 2], f[u * 2 + 1]);
    }
    void apply(int u, const Tag &k) {
        f[u].apply(k);
        tag[u].apply(k);
    }
    void downdate(int u) {
        apply(u * 2, tag[u]);
        apply(u * 2 + 1, tag[u]);
        tag[u] = Tag();
    }
    void modify(int u, int l, int r, int p, const Info &k) {
        if (r - l == 1) {
            f[u] = k;
            return;
        }
        downdate(u);
        int mid = (l + r) / 2;
        if (p < mid) {
            modify(u * 2, l, mid, p, k);
        } else {
            modify(u * 2 + 1, mid, r, p, k);
        }
        update(u);
    }
    void rangeApply(int u, int l, int r, int L, int R, const Tag &k) {
        if (L <= l && r <= R) {
            apply(u, k);
            return;
        }
        downdate(u);
        int mid = (l + r) / 2;
        if (L < mid) {
            rangeApply(u * 2, l, mid, L, R, k);
        }
        if (R > mid) {
            rangeApply(u * 2 + 1, mid, r, L, R, k);
        }
        update(u);
    }
    Info rangeQuery(int u, int l, int r, int L, int R) {
        if (L <= l && r <= R) {
            return f[u];
        }
        downdate(u);
        int mid = (l + r) / 2;
        if (L >= mid) {
            return rangeQuery(u * 2 + 1, mid, r, L, R);
        }
        if (R <= mid) {
            return rangeQuery(u * 2, l, mid, L, R);
        }
        return merge(rangeQuery(u * 2, l, mid, L, R), rangeQuery(u * 2 + 1, mid, r, L, R));
    }
public:
    LazySegmentTree(int n) : merge(Merge()), n(n), f(n * 4), tag(n * 4) {}
    void modify(int p, const Info &k) {
        if (p < 0 || p >= n) return;
        modify(1, 0, n, p, k);
    }
    void rangeApply(int l, int r, const Tag &k) {
        if (l >= r) return;
        rangeApply(1, 0, n, l, r, k);
    }
    Info rangeQuery(int l, int r) {
        if (l >= r) return Info();
        return rangeQuery(1, 0, n, l, r);
    }
};