| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 582292 | 1ne | 벽 (IOI14_wall) | C++14 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
//#include "wall.h"
#include<bits/stdc++.h>
using namespace std;
struct dataa{
long long x =0,type = 0,supp = 0,range = 0;
pair<long long,long long>lazy;
void add(long long left,long long right,pair<long long,long long> val){
if (type == 0){
x = val.second;
type = val.first;
lazy = val;
}
else if (type == val.first){
if (val.first == 1){
if (supp!=type){
x = max(x,min(val.second,range));
}
else
x = max(x,val.second);
}
else{
if (supp!=type){
x = min(x,max(val.second,range));
}
else
x = min(x,val.second);
}
type = val.first;
lazy = val;
}
else if (supp == type){
range = val.second;
}
else{
if (val.first == 1){
range = max(range,val.second);
}
else{
range = min(range,val.second);
}
}
supp|=val.first;
}
};
long long S,T;
struct Segment_Tree{
vector<dataa>tree;
void init(long long n){
tree.resize(2*n - 1);
}
dataa combine(dataa left,dataa right){
dataa res;
res.type = (left.type | right.type);
res.supp = (left.supp | right.supp);
res.x = left.x + right.x;
if (left.type == 1){
res.range = max(left.range,right.range);
}
else res.range = min(left.range,right.range);
return res;
}
void push(long long node,long long left,long long right){
long long mid = (left + right)>>1;
long long z = node + ((mid - left + 1)<<1);
if (tree[node].lazy.first!=0){
tree[node + 1].add(left,mid,tree[node].lazy);
tree[z].add(mid + 1,right,tree[node].lazy);
tree[node].lazy.first = 0;
}
}
dataa query(long long node,long long left,long long right,long long qleft,long long qright){
if (qright<left|| qleft > right)return {0,0,0};
if (qleft<=left && qright>=right){
return tree[node];
}
push(node,left,right);
long long mid = (left + right)>>1;
long long z = node + ((mid - left + 1)<<1);
return combine(query(node + 1,left,mid,qleft,qright),query(z,mid + 1,right,qleft,qright));
}
void update(long long node,long long left,long long right,long long uleft,long long uright,pair<long long,long long> v){
if (left > uright || right < uleft) return;
if (uleft <= left && right <=uright){
tree[node].add(left,right,v);
return;
}
push(node,left,right);
long long mid = (left + right)>>1;
long long z = node + ((mid - left + 1)<<1);
if (uleft<=mid){
update(node + 1,left,mid,uleft,uright,v);
}
if (uright > mid){
update(z,mid + 1,right,uleft,uright,v);
}
tree[node] = combine(tree[node + 1],tree[z]);
}
};
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
Segment_Tree st;
st.init(n);
function<void(int,int,int,int)> solve = [&](int l,int r,int o,int v){
if (l > r)return;
int temp = st.query(0,0,n-1,l,r).supp;
if (temp == o || temp == 0){
st.update(0,0,n-1,l,r,make_pair(o,v));
return;
}
else if (l == r){
st.update(0,0,n-1,l,r,make_pair(o,v));
}
else{
int mid = (l + r)>>1;
solve(l,mid,o,v);
solve(mid + 1,r,o,v);
}
};
for (int i = k - 1;i>=0;--i){
solve(left[i],right[i],op[i],height[i]);
}
for (int i = 0;i<n;++i){
solve(i,i,2,0);
}
for (int i = 0;i<n;++i){
finalHeight[i] = st.query(0,0,n-1,i,i).x;
}
}
/*
10 6
1 1 8 4
2 4 9 1
2 3 6 5
1 0 5 3
1 2 2 5
2 6 7 0
3
4
5
4
3
3
0
0
1
0
10 3
1 3 4 91220
1 5 9 48623
2 3 5 39412
0
0
0
39412
39412
39412
48623
48623
48623
48623
*/
int main()
{
int n;
int k;
int i, j;
int status = 0;
status = scanf("%d%d", &n, &k);
assert(status == 2);
int* op = (int*)calloc(sizeof(int), k);
int* left = (int*)calloc(sizeof(int), k);
int* right = (int*)calloc(sizeof(int), k);
int* height = (int*)calloc(sizeof(int), k);
int* finalHeight = (int*)calloc(sizeof(int), n);
for (i = 0; i < k; i++){
status = scanf("%d%d%d%d", &op[i], &left[i], &right[i], &height[i]);
assert(status == 4);
}
buildWall(n, k, op, left, right, height, finalHeight);
for (j = 0; j < n; j++)
printf("%d\n", finalHeight[j]);
return 0;
}