#include "wall.h"
#include<bits/stdc++.h>
using namespace std;
struct dataa{
long long minny = 1e9,maxxy = 0;
void add(dataa v){
minny = min(minny,v.minny);
maxxy = max(maxxy,v.maxxy);
}
};
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.minny = max(left.minny,right.minny);
res.maxxy = min(left.maxxy,right.maxxy);
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);
tree[node + 1].add(tree[node]);
tree[z].add(tree[node]);
tree[node + 1].minny = max(tree[node + 1].minny,tree[node].maxxy);
tree[z].minny = max(tree[z].minny,tree[node].maxxy);
tree[node + 1].maxxy = min(tree[node + 1].maxxy,tree[node].minny);
tree[z].maxxy = min(tree[z].maxxy,tree[node].minny);
}
long long query(long long node,long long left,long long right,long long qleft,long long qright){
if (qright<left|| qleft > right)return 1e9;
if (qleft<=left && qright>=right){
return min(tree[node].minny,tree[node].maxxy);
}
push(node,left,right);
long long mid = (left + right)>>1;
long long z = node + ((mid - left + 1)<<1);
return min(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,long long h,long long type){
if (left > uright || right < uleft) return;
if (uleft <= left && right <=uright){
if (type == 1){
tree[node].minny = max(tree[node].minny,h);
tree[node].maxxy = max(tree[node].maxxy,h);
}
else{
tree[node].minny = min(tree[node].minny,h);
tree[node].maxxy = min(tree[node].maxxy,h);
}
return;
}
push(node,left,right);
tree[node].minny = 1e9;
tree[node].maxxy = 0;
long long mid = (left + right)>>1;
long long z = node + ((mid - left + 1)<<1);
if (uleft<=mid){
update(node + 1,left,mid,uleft,uright,h,type);
}
if (uright > mid){
update(z,mid + 1,right,uleft,uright,h,type);
}
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);
for (int i = 0;i<k;++i){
st.update(0,0,n - 1,left[i],right[i],height[i],op[i]);
}
for (int i = 0;i<n;++i){
finalHeight[i] = st.query(0,0,n-1,i,i);
}
}
