#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define L(i) i*2+1
#define R(i) i*2+2
using namespace std;
typedef pair<int, int> pii;
pii update(int i, int l, int r, int a, int b, pii op, pii tree[], pii lazy[]){
if(lazy[i].first != -1){
tree[i].first = min(max(tree[i].first, lazy[i].first), lazy[i].second);
tree[i].second = max(min(tree[i].second, lazy[i].second), lazy[i].first);
if(l != r) {
lazy[L(i)] = lazy[R(i)] = {tree[i].first, tree[i].second};
}
lazy[i] = {-1, -1};
}
if(l > b || r < a) return tree[i];
if(a <= l && r <= b){
if(op.first == 1){
tree[i].first = max(tree[i].first, op.second);
if(tree[i].first > tree[i].second){
tree[i].second = tree[i].first;
}
} else {
tree[i].second = min(tree[i].second, op.second);
if(tree[i].first > tree[i].second){
tree[i].first = tree[i].second;
}
}
if(l != r) lazy[L(i)] = lazy[R(i)] = tree[i];
}
if(l != r){
int mid = (l+r)/2;
pii left = update(L(i), l, mid, a, b, op, tree, lazy), right = update(R(i), mid+1, r, a, b, op, tree, lazy);
tree[i] = {min(left.first, right.first), max(left.second, right.second)};
}
return tree[i];
}
int get(int i, int l, int r, int ind, pii tree[], pii lazy[]){
if(lazy[i].first != -1){
tree[i].first = min(max(tree[i].first, lazy[i].first), lazy[i].second);
tree[i].second = max(min(tree[i].second, lazy[i].second), lazy[i].first);
if(l != r) {
lazy[L(i)] = lazy[R(i)] = {tree[i].first, tree[i].second};
}
lazy[i] = {-1, -1};
}
if(l > ind || r < ind) return -1;
if(l == r)
return tree[i].first;
int mid = (l+r)/2;
return max(get(L(i), l, mid, ind, tree, lazy), get(R(i), mid+1, r, ind, tree, lazy));
}
void buildWall(int n, int k, int op[], int left[], int right[],int height[], int finalHeight[]){
pii *tree = new pii[3 * n + 100], *lazy = new pii[3 * n + 100];
for(int i = 0;i < 3*n+100;i++) {
lazy[i] = {-1, -1};
tree[i] = {0, 0};
}
printf("mama\n");
for(int i = 0;i < k;i++){
update(0, 0, n-1, left[i], right[i], {op[i], height[i]}, tree, lazy);
}
for(int i = 0;i < n;i++){
finalHeight[i] = get(0, 0, n-1, i, tree, lazy);
}
delete[] tree;
delete[] lazy;
}
Compilation message
wall.cpp:1: warning: ignoring #pragma GCC optimization [-Wunknown-pragmas]
1 | #pragma GCC optimization ("unroll-loops")
|
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
0 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
