#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define INF 100005
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
#include "wall.h"
ii combine(ii upd_new, ii upd_old) { // apply upd_new to upd_old
ii res = {max(upd_new.fi, upd_old.fi), min(upd_new.se, upd_old.se)};
if (res.fi > res.se) { // The ranges are disjoint, so suffices to check either
return (upd_old.se < upd_new.se) ? make_pair(upd_new.fi, upd_new.fi) : make_pair(upd_new.se, upd_new.se);
}
return res;
}
struct Segtree { // Segtree of updates
int sz;
vector<ii> upd; // store (a, b)
Segtree(int N) {
sz = 1;
while (sz < N)
sz *= 2;
upd = vii(2 * sz, {0, INF});
}
void push(int id) { // O(1), for regular updates
if (id+1 >= sz)
return;
upd[(id<<1)|1] = combine(upd[id], upd[(id<<1)|1]);
upd[2 * id + 2] = combine(upd[id], upd[2 * id + 2]);
upd[id] = {0, INF};
}
void push_recursive(int id, int left, int right) { // O(N), only for answer extraction at the end
if(right - left == 1)
return;
push(id);
int mid = (left + right)>>1;
push_recursive((id<<1)|1, left, mid);
push_recursive(2 * id + 2, mid, right);
}
void range_upd(int qleft, int qright, ii val, int id, int left, int right) {
if (qleft <= left && right <= qright) {
upd[id] = combine(val, upd[id]);
return;
}
if (qright <= left || right <= qleft)
return;
push(id);
int mid = (left + right)>>1;
range_upd(qleft, qright, val, (id<<1)|1, left, mid);
range_upd(qleft, qright, val, 2 * id + 2, mid, right);
}
void range_upd(int qleft, int qright, ii val) {
range_upd(qleft, qright, val, 0, 0, sz);
}
};
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) {
Segtree tree(n);
for(int z = 0; z < k; z++) {
ii upd_val = (op[z] == 1) ? make_pair(height[z], INF) : make_pair(0, height[z]);
tree.range_upd(left[z], right[z]+1, upd_val);
}
tree.push_recursive(0, 0, tree.sz);
for(int z = 0; z < n; z++) {
finalHeight[z] = tree.upd[z+tree.sz-1].fi;
}
return;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
344 KB |
Output is correct |
4 |
Correct |
4 ms |
604 KB |
Output is correct |
5 |
Correct |
3 ms |
604 KB |
Output is correct |
6 |
Correct |
3 ms |
604 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
76 ms |
8100 KB |
Output is correct |
3 |
Correct |
100 ms |
4152 KB |
Output is correct |
4 |
Correct |
319 ms |
10644 KB |
Output is correct |
5 |
Correct |
163 ms |
10580 KB |
Output is correct |
6 |
Correct |
148 ms |
10576 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
388 KB |
Output is correct |
4 |
Correct |
4 ms |
604 KB |
Output is correct |
5 |
Correct |
3 ms |
804 KB |
Output is correct |
6 |
Correct |
3 ms |
604 KB |
Output is correct |
7 |
Correct |
0 ms |
348 KB |
Output is correct |
8 |
Correct |
82 ms |
8192 KB |
Output is correct |
9 |
Correct |
92 ms |
4176 KB |
Output is correct |
10 |
Correct |
340 ms |
10488 KB |
Output is correct |
11 |
Correct |
162 ms |
10836 KB |
Output is correct |
12 |
Correct |
144 ms |
10576 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
76 ms |
8260 KB |
Output is correct |
15 |
Correct |
22 ms |
1368 KB |
Output is correct |
16 |
Correct |
400 ms |
10564 KB |
Output is correct |
17 |
Correct |
161 ms |
10588 KB |
Output is correct |
18 |
Correct |
160 ms |
10576 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
600 KB |
Output is correct |
2 |
Correct |
1 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
3 ms |
604 KB |
Output is correct |
5 |
Correct |
3 ms |
604 KB |
Output is correct |
6 |
Correct |
3 ms |
604 KB |
Output is correct |
7 |
Correct |
0 ms |
344 KB |
Output is correct |
8 |
Correct |
77 ms |
8108 KB |
Output is correct |
9 |
Correct |
98 ms |
4180 KB |
Output is correct |
10 |
Correct |
335 ms |
10576 KB |
Output is correct |
11 |
Correct |
147 ms |
10492 KB |
Output is correct |
12 |
Correct |
170 ms |
10592 KB |
Output is correct |
13 |
Correct |
0 ms |
348 KB |
Output is correct |
14 |
Correct |
80 ms |
8048 KB |
Output is correct |
15 |
Correct |
23 ms |
1372 KB |
Output is correct |
16 |
Correct |
375 ms |
10548 KB |
Output is correct |
17 |
Correct |
172 ms |
10496 KB |
Output is correct |
18 |
Correct |
185 ms |
10580 KB |
Output is correct |
19 |
Correct |
367 ms |
48716 KB |
Output is correct |
20 |
Correct |
371 ms |
48860 KB |
Output is correct |
21 |
Correct |
374 ms |
49012 KB |
Output is correct |
22 |
Correct |
360 ms |
48764 KB |
Output is correct |
23 |
Correct |
390 ms |
48780 KB |
Output is correct |
24 |
Correct |
358 ms |
48724 KB |
Output is correct |
25 |
Correct |
355 ms |
48724 KB |
Output is correct |
26 |
Correct |
343 ms |
48724 KB |
Output is correct |
27 |
Correct |
332 ms |
48720 KB |
Output is correct |
28 |
Correct |
346 ms |
48976 KB |
Output is correct |
29 |
Correct |
337 ms |
48724 KB |
Output is correct |
30 |
Correct |
327 ms |
48888 KB |
Output is correct |