Submission #81095

ソースコード

?
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
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
#include<bits/stdc++.h>
using namespace std;
namespace atcoder {
namespace internal {
long long ceil_pow2(long long n) {
long long x = 0;
while ((1U << x) < (unsigned long long)(n)) x++;
return x;
}
long long bsf(unsigned long long n) {
#ifdef _MSC_VER
unsigned long index;
_BitScanForward(&index, n);
return index;
#else
return __builtin_ctz(n);
#endif
}
}
}
namespace atcoder {
template <class S,
S (*op)(S, S),
S (*e)(),
class F,
S (*mapping)(F, S),
F (*composition)(F, F),
F (*id)()>
struct lazy_segtree {
public:
lazy_segtree() : lazy_segtree(0) {}
lazy_segtree(long long n) : lazy_segtree(std::vector<S>(n, e())) {}
lazy_segtree(const std::vector<S>& v) : _n(int(v.size())) {
log = internal::ceil_pow2(_n);
size = 1 << log;
d = std::vector<S>(2 * size, e());
lz = std::vector<F>(size, id());
for (long long i = 0; i < _n; i++) d[size + i] = v[i];
for (long long i = size - 1; i >= 1; i--) {
update(i);
}
}
void set(long long p, S x) {
assert(0 <= p && p < _n);
p += size;
for (long long i = log; i >= 1; i--) push(p >> i);
d[p] = x;
for (long long i = 1; i <= log; i++) update(p >> i);
}
S get(long long p) {
assert(0 <= p && p < _n);
p += size;
for (long long i = log; i >= 1; i--) push(p >> i);
return d[p];
}
S prod(long long l, long long r) {
assert(0 <= l && l <= r && r <= _n);
if (l == r) return e();
l += size;
r += size;
for (long long i = log; i >= 1; i--) {
if (((l >> i) << i) != l) push(l >> i);
if (((r >> i) << i) != r) push(r >> i);
}
S sml = e(), smr = e();
while (l < r) {
if (l & 1) sml = op(sml, d[l++]);
if (r & 1) smr = op(d[--r], smr);
l >>= 1;
r >>= 1;
}
return op(sml, smr);
}
S all_prod() { return d[1]; }
void apply(long long p, F f) {
assert(0 <= p && p < _n);
p += size;
for (long long i = log; i >= 1; i--) push(p >> i);
d[p] = mapping(f, d[p]);
for (long long i = 1; i <= log; i++) update(p >> i);
}
void apply(long long l, long long r, F f) {
assert(0 <= l && l <= r && r <= _n);
if (l == r) return;
l += size;
r += size;
for (long long i = log; i >= 1; i--) {
if (((l >> i) << i) != l) push(l >> i);
if (((r >> i) << i) != r) push((r - 1) >> i);
}
{
long long l2 = l, r2 = r;
while (l < r) {
if (l & 1) all_apply(l++, f);
if (r & 1) all_apply(--r, f);
l >>= 1;
r >>= 1;
}
l = l2;
r = r2;
}
for (long long i = 1; i <= log; i++) {
if (((l >> i) << i) != l) update(l >> i);
if (((r >> i) << i) != r) update((r - 1) >> i);
}
}
template <bool (*g)(S)> long long max_right(long long l) {
return max_right(l, [](S x) { return g(x); });
}
template <class G> long long max_right(long long l, G g) {
assert(0 <= l && l <= _n);
assert(g(e()));
if (l == _n) return _n;
l += size;
for (long long i = log; i >= 1; i--) push(l >> i);
S sm = e();
do {
while (l % 2 == 0) l >>= 1;
if (!g(op(sm, d[l]))) {
while (l < size) {
push(l);
l = (2 * l);
if (g(op(sm, d[l]))) {
sm = op(sm, d[l]);
l++;
}
}
return l - size;
}
sm = op(sm, d[l]);
l++;
} while ((l & -l) != l);
return _n;
}
template <bool (*g)(S)> long long min_left(long long r) {
return min_left(r, [](S x) { return g(x); });
}
template <class G> long long min_left(long long r, G g) {
assert(0 <= r && r <= _n);
assert(g(e()));
if (r == 0) return 0;
r += size;
for (long long i = log; i >= 1; i--) push((r - 1) >> i);
S sm = e();
do {
r--;
while (r > 1 && (r % 2)) r >>= 1;
if (!g(op(d[r], sm))) {
while (r < size) {
push(r);
r = (2 * r + 1);
if (g(op(d[r], sm))) {
sm = op(d[r], sm);
r--;
}
}
return r + 1 - size;
}
sm = op(d[r], sm);
} while ((r & -r) != r);
return 0;
}
private:
long long _n, size, log;
std::vector<S> d;
std::vector<F> lz;
void update(long long k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
void all_apply(long long k, F f) {
d[k] = mapping(f, d[k]);
if (k < size) lz[k] = composition(f, lz[k]);
}
void push(long long k) {
all_apply(2 * k, lz[k]);
all_apply(2 * k + 1, lz[k]);
lz[k] = id();
}
};
}
//区間加算、区間最小値---------------------
/*
using S = long long;
using F = long long;
const S INF = 8e18;
S op(S a, S b){ return std::min(a, b); }
S e(){ return INF; }
S mapping(F f, S x){ return f+x; }
F composition(F f, F g){ return f+g; }
F id(){ return 0; }
signed main(){
long long n;
std::vector<S> v(n);
atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> seg(v);
}
*/
//区間加算、区間最大値---------------------
/*
using S = long long;
using F = long long;
const S INF = 8e18;
S op(S a, S b){ return std::max(a, b); }
S e(){ return -INF; }
S mapping(F f, S x){ return f+x; }
F composition(F f, F g){ return f+g; }
F id(){ return 0; }
signed main(){
long long n;
std::vector<S> v(n);
atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> seg(v);
}
*/
//区間加算、区間和--------------------------
/*
struct S{
long long value;
long long size;
};
using F = long long;
S op(S a, S b){ return {a.value+b.value, a.size+b.size}; }
S e(){ return {0, 0}; }
S mapping(F f, S x){ return {x.value + f*x.size, x.size}; }
F composition(F f, F g){ return f+g; }
F id(){ return 0; }
signed main(){
long long n;
std::vector<S> v(n, {0, 1});
atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> seg(v);
}
*/
//区間変更、区間最小値-----------------
/*
using S = long long;
using F = long long;
const S INF = 8e18;
const F ID = 8e18;
S op(S a, S b){ return std::min(a, b); }
S e(){ return INF; }
S mapping(F f, S x){ return (f == ID ? x : f); }
F composition(F f, F g){ return (f == ID ? g : f); }
F id(){ return ID; }
signed main(){
long long n;
std::vector<S> v(n);
atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> seg(v);
}
*/
//区間変更、区間最大値-----------------
/*
using S = long long;
using F = long long;
const S INF = 8e18;
const F ID = 8e18;
S op(S a, S b){ return std::max(a, b); }
S e(){ return -INF; }
S mapping(F f, S x){ return (f == ID ? x : f); }
F composition(F f, F g){ return (f == ID ? g : f); }
F id(){ return ID; }
signed main(){
long long n;
std::vector<S> v(n);
atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> seg(v);
}
*/
//区間変更、区間和-----------------
/*
struct S{
long long value;
long long size;
};
using F = long long;
const F ID = 8e18;
S op(S a, S b){ return {a.value+b.value, a.size+b.size}; }
S e(){ return {0, 0}; }
S mapping(F f, S x){
if(f != ID) x.value = f*x.size;
return x;
}
F composition(F f, F g){ return (f == ID ? g : f); }
F id(){ return ID; }
signed main(){
long long n;
std::vector<S> v(n, {0, 1});
atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> seg(v);
}
*/
// 上のコメント化を外して使う
/* 更新クエリと結果クエリの書き方　　[)右半開区間
seg.apply(s, t+1, x);
seg.prod(s, t+1)
*/
using S = long long;
using F = long long;
const S INF = 8e18;
const F ID = 8e18;
S op(S a, S b){ return std::min(a, b); }
S e(){ return INF; }
S mapping(F f, S x){ return (f == ID ? x : f); }
F composition(F f, F g){ return (f == ID ? g : f); }
F id(){ return ID; }
signed main(){
int n;cin>>n;
std::vector<S> v(n);
atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> seg(v);
for(int i=0;i<n;i++){
int a;cin>>a;
seg.apply(i,i+1,a);
}
while(true){
string s;cin>>s;
if(s=="exit"){
return(0);
}else if(s=="update"){
int a,b;cin>>a>>b;
seg.apply(a,a+1,b);
}else{
int a,b;cin>>a>>b;
cout<<seg.prod(a,b+1)<<"\n";
}
}
}

ステータス

項目 データ
問題 0459 - セグメントツリー練習
ユーザー名 ei2326
投稿日時 2024-09-11 08:22:04
言語 C++17
状態 Accepted
得点 10
ソースコード長 9328 Byte
最大実行時間 85 ms
最大メモリ使用量 5100 KB

セット

セット 得点 Cases
1 ALL 10 / 10 *

テストケース

ファイル名 状態 実行時間 メモリ使用量 #
Input01 AC 21 ms 604 KB
1
Input02 AC 25 ms 444 KB
1
Input03 AC 23 ms 416 KB
1
Input04 AC 29 ms 508 KB
1
Input05 AC 21 ms 476 KB
1
Input06 AC 22 ms 572 KB
1
Input07 AC 29 ms 540 KB
1
Input08 AC 20 ms 620 KB
1
Input09 AC 41 ms 780 KB
1
Input10 AC 85 ms 5100 KB
1