-
Notifications
You must be signed in to change notification settings - Fork 0
/
SegmentTreeBeats.cpp
255 lines (253 loc) · 9.58 KB
/
SegmentTreeBeats.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
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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
/*
* @title SegmentTreeBeats
* @docs md/segment-tree/SegmentTreeBeats.md
*/
template<class T> class SegmentTreeBeats {
T inf;
size_t length;
vector<T>
node_max_first,node_max_second,count_max_first,
node_min_first,node_min_second,count_min_first,
node_sum,lazy_add,lazy_update;
vector<pair<int,int>> range;
stack<int> down,up;
inline void internal_chmax(int k, long long x) {
node_sum[k] += (x - node_max_first[k]) * count_max_first[k];
if(node_max_first[k] == node_min_first[k]) node_max_first[k] = node_min_first[k] = x;
else if(node_max_first[k] == node_min_second[k]) node_max_first[k] = node_min_second[k] = x;
else node_max_first[k] = x;
if(lazy_update[k] != inf && x < lazy_update[k]) lazy_update[k] = x;
}
inline void internal_chmin(int k, long long x) {
node_sum[k] += (x - node_min_first[k]) * count_min_first[k];
if(node_max_first[k] == node_min_first[k]) node_max_first[k] = node_min_first[k] = x;
else if(node_max_second[k] == node_min_first[k]) node_min_first[k] = node_max_second[k] = x;
else node_min_first[k] = x;
if(lazy_update[k] != inf && lazy_update[k] < x) lazy_update[k] = x;
}
inline void internal_add(int k, long long x) {
node_max_first[k] += x;
if(node_max_second[k] != -inf) node_max_second[k] += x;
node_min_first[k] += x;
if(node_min_second[k] != inf) node_min_second[k] += x;
node_sum[k] += x * (range[k].second - range[k].first);
(lazy_update[k] != inf ? lazy_update[k]:lazy_add[k]) += x;
}
inline void internal_update(int k, long long x) {
node_max_first[k] = x; node_max_second[k] = -inf;
node_min_first[k] = x; node_min_second[k] = inf;
count_max_first[k] = count_min_first[k] = (range[k].second - range[k].first);
node_sum[k] = x * (range[k].second - range[k].first);
lazy_update[k] = x;
lazy_add[k] = 0;
}
inline void propagate(int k) {
if(length-1 <= k) return;
if(lazy_update[k] != inf) {
internal_update(2*k+0, lazy_update[k]);
internal_update(2*k+1, lazy_update[k]);
lazy_update[k] = inf;
return;
}
if(lazy_add[k] != 0) {
internal_add(2*k+0, lazy_add[k]);
internal_add(2*k+1, lazy_add[k]);
lazy_add[k] = 0;
}
if(node_max_first[k] < node_max_first[2*k+0]) {
internal_chmax(2*k+0, node_max_first[k]);
}
if(node_min_first[2*k+0] < node_min_first[k]) {
internal_chmin(2*k+0, node_min_first[k]);
}
if(node_max_first[k] < node_max_first[2*k+1]) {
internal_chmax(2*k+1, node_max_first[k]);
}
if(node_min_first[2*k+1] < node_min_first[k]) {
internal_chmin(2*k+1, node_min_first[k]);
}
}
inline void merge(int k) {
node_sum[k] = node_sum[2*k+0] + node_sum[2*k+1];
if(node_max_first[2*k+0] < node_max_first[2*k+1]) {
node_max_first[k] = node_max_first[2*k+1];
count_max_first[k] = count_max_first[2*k+1];
node_max_second[k] = max(node_max_first[2*k+0], node_max_second[2*k+1]);
}
else if(node_max_first[2*k+0] > node_max_first[2*k+1]) {
node_max_first[k] = node_max_first[2*k+0];
count_max_first[k] = count_max_first[2*k+0];
node_max_second[k] = max(node_max_second[2*k+0], node_max_first[2*k+1]);
}
else {
node_max_first[k] = node_max_first[2*k+0];
count_max_first[k] = count_max_first[2*k+0] + count_max_first[2*k+1];
node_max_second[k] = max(node_max_second[2*k+0], node_max_second[2*k+1]);
}
if(node_min_first[2*k+0] < node_min_first[2*k+1]) {
node_min_first[k] = node_min_first[2*k+0];
count_min_first[k] = count_min_first[2*k+0];
node_min_second[k] = min(node_min_second[2*k+0], node_min_first[2*k+1]);
}
else if(node_min_first[2*k+0] > node_min_first[2*k+1]) {
node_min_first[k] = node_min_first[2*k+1];
count_min_first[k] = count_min_first[2*k+1];
node_min_second[k] = min(node_min_first[2*k+0], node_min_second[2*k+1]);
}
else {
node_min_first[k] = node_min_first[2*k+0];
count_min_first[k] = count_min_first[2*k+0] + count_min_first[2*k+1];
node_min_second[k] = min(node_min_second[2*k+0], node_min_second[2*k+1]);
}
}
inline void up_merge(void){
while(up.size()) {
merge(up.top());
up.pop();
}
}
inline void down_propagate(const int& k) {
propagate(k);
down.push(2*k+0);
down.push(2*k+1);
}
public:
SegmentTreeBeats(const int num,const T inf = (1LL<<60)) {
vector<T> a(num,0);
*this = SegmentTreeBeats(a,inf);
}
SegmentTreeBeats(const vector<T>& a,const T inf = (1LL<<60)) : inf(inf){
int num = a.size();
for (length = 1; length <= num; length *= 2);
node_max_first.resize(2*length);
node_max_second.resize(2*length);
count_max_first.resize(2*length);
node_min_first.resize(2*length);
node_min_second.resize(2*length);
count_min_first.resize(2*length);
node_sum.resize(2*length);
range.resize(2*length);
lazy_add.resize(2*length);
lazy_update.resize(2*length);
for(int i=0; i<2*length; ++i) lazy_add[i] = 0, lazy_update[i] = inf;
for(int i = 0; i < length; ++i) range[i+length] = make_pair(i,i+1);
for(int i = length - 1; i >= 0; --i) range[i] = make_pair(range[(i<<1)+0].first,range[(i<<1)+1].second);
for(int i=0; i<num; ++i) {
node_max_first[length+i] = node_min_first[length+i] = node_sum[length+i] = a[i];
node_max_second[length+i] = -inf;
node_min_second[length+i] = inf;
count_max_first[length+i] = count_min_first[length+i] = 1;
}
for(int i=num; i<length; ++i) {
node_max_first[length+i] = node_max_second[length+i] = -inf;
node_min_first[length+i] = node_min_second[length+i] = inf;
count_max_first[length+i] = count_min_first[length+i] = 0;
}
for(int i=length-1; i; --i) merge(i);
}
inline void range_chmin(int a, int b, long long x) {
down.push(1);
while(down.size()) {
int k = down.top();
down.pop();
if(b <= range[k].first || range[k].second <= a || node_max_first[k] <= x) continue;
if(a <= range[k].first && range[k].second <= b && node_max_second[k] < x) {
internal_chmax(k, x);
continue;
}
down_propagate(k);
up.push(k);
}
up_merge();
}
inline void range_chmax(int a, int b, long long x,int k = 1) {
down.push(1);
while(down.size()) {
int k = down.top();
down.pop();
if(b <= range[k].first || range[k].second <= a || x <= node_min_first[k]) continue;
if(a <= range[k].first && range[k].second <= b && x < node_min_second[k]) {
internal_chmin(k, x);
continue;
}
down_propagate(k);
up.push(k);
}
up_merge();
}
inline void range_add(int a, int b, long long x,int k = 1) {
down.push(1);
while(down.size()) {
int k = down.top();
down.pop();
if(b <= range[k].first || range[k].second <= a) continue;
if(a <= range[k].first && range[k].second <= b) {
internal_add(k, x);
continue;
}
down_propagate(k);
up.push(k);
}
up_merge();
}
inline void range_update(int a, int b, long long x,int k = 1) {
down.push(1);
while(down.size()) {
int k = down.top();
down.pop();
if(b <= range[k].first || range[k].second <= a) continue;
if(a <= range[k].first && range[k].second <= b) {
internal_update(k, x);
continue;
}
down_propagate(k);
up.push(k);
}
up_merge();
}
inline T get_max(int a, int b, int k = 1) {
down.push(1);
long long v = inf;
while(down.size()) {
int k = down.top();
down.pop();
if(b <= range[k].first || range[k].second <= a) continue;
if(a <= range[k].first && range[k].second <= b) {
v = max(v,node_max_first[k]);
continue;
}
down_propagate(k);
}
return v;
}
inline T get_min(int a, int b, int k = 1) {
down.push(1);
long long v = inf;
while(down.size()) {
int k = down.top();
down.pop();
if(b <= range[k].first || range[k].second <= a) continue;
if(a <= range[k].first && range[k].second <= b) {
v = min(v,node_min_first[k]);
continue;
}
down_propagate(k);
}
return v;
}
inline T get_sum(int a, int b, int k=1) {
down.push(1);
long long v = 0;
while(down.size()) {
int k = down.top();
down.pop();
if(b <= range[k].first || range[k].second <= a) continue;
if(a <= range[k].first && range[k].second <= b) {
v += node_sum[k];
continue;
}
down_propagate(k);
}
return v;
}
};