/
seg_tree.cpp
98 lines (83 loc) · 2.09 KB
/
seg_tree.cpp
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
/*
In the name of ALLAH
Author : Raashid Anwar
*/
#include <bits/stdc++.h>
using namespace std;
#define int int64_t
const int M1 = 998244353;
const int M2 = 1000000007;
mt19937 rng((uint64_t)chrono::steady_clock::now().time_since_epoch().count());
class seg_tree {
int n;
vector <int> tree, lazy;
public :
seg_tree(int _n) : n(_n) {
tree.resize(n * 4 + 11, 0);
lazy.resize(n * 4 + 11, 0);
}
void upd(int n, int s, int e, int i, int x) {
if (s == e) {
tree[n] = x;
} else {
int m = (s + e) >> 1;
if (i <= m) {
upd(n << 1, s, m, i, x);
} else {
upd(n << 1 | 1, m + 1, e, i, x);
}
tree[n] = tree[n << 1] + tree[n << 1 | 1];
}
}
void upd(int i, int x) {
upd(1, 1, n, i, x);
}
int get_sum(int n, int s, int e, int l, int r) {
if (s > e || s > r || e < l)
return 0;
if (lazy[n])
shift(n, s, e);
if (l <= s && e <= r)
return tree[n];
int m = (s + e) >> 1;
return get_sum(n << 1, s, m, l, r) + get_sum(n << 1 | 1, m + 1, e, l, r);
}
int get_sum(int l, int r) {
assert(l <= r && l >= 1 && r <= n);
return get_sum(1, 1, n, l, r);
}
void shift(int n, int s, int e) {
tree[n] += (e - s + 1) * lazy[n];
if (s != e) {
lazy[n << 1] += lazy[n];
lazy[n << 1 | 1] += lazy[n];
}
lazy[n] = 0;
}
void lazy_upd(int n, int s, int e, int l, int r, int x) {
if (lazy[n])
shift(n, s, e);
if (s > e || s > r || e < l)
return ;
if (l <= s && e <= r) {
lazy[n] = x;
shift(n, s, e);
return ;
}
int m = (s + e) >> 1;
lazy_upd(n << 1, s, m, l, r, x);
lazy_upd(n << 1 | 1, m + 1, e, l, r, x);
tree[n] = tree[n << 1] + tree[n << 1 | 1];
}
void lazy_upd(int l, int r, int x) {
assert(l <= r && l >= 1 && r <= n);
lazy_upd(1, 1, n, l, r, x);
}
};
void solve() {
}
int32_t main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
solve();
}