# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1113650 |
2024-11-16T23:48:05 Z |
sunboi |
Wall (IOI14_wall) |
C++17 |
|
0 ms |
0 KB |
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 1000;
vector<int> a(N);
vector<pair<long long, long long>> t(4 * N);
vector<int>lazy(4 * N);
void push(int v, int vl, int vr){
if (lazy[v] == 1){
t[2 * v].first = max(t[2 * v].first, t[v].first);
t[2 * v].second = max(t[2 * v].second, t[v].second);
t[2 * v + 1].first = max(t[2 * v + 1].first, t[v].first);
t[2 * v + 1].second = max(t[2 * v + 1].second, t[v].second);
lazy[2 * v] = lazy[2 * v + 1] = 1;
lazy[v] = 0;
}else if (lazy[v] == 2){
t[2 * v].first = min(t[2 * v].first, t[v].first);
t[2 * v].second = min(t[2 * v].second, t[v].second);
t[2 * v + 1].first = min(t[2 * v + 1].first, t[v].first);
t[2 * v + 1].second = min(t[2 * v + 1].second, t[v].second);
lazy[2 * v] = lazy[2 * v + 1] = 2;
lazy[v] = 0;
}
t[2 * v + 1].first = min(max(t[2 * v + 1].first, t[v].first), t[v].second);
t[2 * v + 1].second = max(min(t[2 * v + 1].second, t[v].second), t[v].first);
}
void build(int v, int vl, int vr) {
if (vl == vr) {
t[v] = {0, 0};
return;
}
int vm = (vl + vr) / 2;
build(2 * v, vl, vm);
build(2 * v + 1, vm + 1, vr);
t[v] = {max(t[2 * v].first, t[2 * v + 1].first), min(t[2 * v].second, t[2 * v + 1].second)};
}
void update(int v, int vl, int vr, int l, int r, long long x){
if (vl > r || vr < l) return;
if (vl >= l && vr <= r){
t[v] = {max(t[v].first, x), max(t[v].second, x)};
lazy[v] = 1;
return;
}
push(v, vl ,vr);
t[v] = {0, 1e9};
int vm = (vl + vr) / 2;
update(2 * v, vl, vm, l, r, x);
update(2 * v + 1, vm + 1, vr, l, r, x);
t[v] = {max(t[2 * v].first, t[2 * v + 1].first), min(t[2 * v].second, t[2 * v + 1].second)};
}
void update2(int v, int vl, int vr, int l, int r, long long x){
if (vl > r || vr < l) return;
if (vl >= l && vr <= r){
t[v] = {min(t[v].first, x), min(t[v].second, x)};
lazy[v] = 2;
return;
}
push(v, vl ,vr);
t[v] = {0, 1e9};
int vm = (vl + vr) / 2;
update2(2 * v, vl, vm, l, r, x);
update2(2 * v + 1, vm + 1, vr, l, r, x);
t[v] = {max(t[2 * v].first, t[2 * v + 1].first), min(t[2 * v].second, t[2 * v + 1].second)};
}
int get(int v, int vl, int vr, int x){
if (vl > x || vr < x) return 0;
if (vr <= x && x <= vl){
return t[v].first;
}
push(v, vl ,vr);
t[v] = {0, 1e9};
int vm = (vl + vr) / 2;
return max(get(2 * v, vl, vm, x), get(2 * v + 1, vm + 1, vr, x));
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
for (int i = 0; i < n; i++){
a[i] = 0;
}
build(1, 0, n - 1);
for (int i = 0; i < k; i++){
if (op[i] == 1){
update(1, 0, n - 1, left[i], right[i], height[i]);
}else update2(1, 0, n - 1, left[i], right[i], height[i]);
}
for (int i = 0; i < n; i++){
finalHeight[i] = get(1, 0, n - 1, i);
¡ }
return;
}
Compilation message
wall.cpp:114:1: error: extended character ¡ is not valid in an identifier
114 | ¡ }
| ^
wall.cpp: In function 'void buildWall(int, int, int*, int*, int*, int*, int*)':
wall.cpp:114:1: error: '\U000000a1' was not declared in this scope
114 | ¡ }
| ^