/*
In the name of Allah
made by: Ahmed_Solyman
*/
#include "wall.h"
#include <bits/stdc++.h>
#include <ext/rope>
using namespace std;
using namespace __gnu_cxx;
#pragma GCC optimize("-Ofast")
#pragma GCC optimize("-O1")
//-------------------------------------------------------------//
typedef long long ll;
typedef unsigned long long ull;
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define PI acos(-1)
#define lb lower_bound
#define ub upper_bound
#define all(v) v.begin(),v.end()
#define allr(v) v.rbegin(),v.rend()
#define sum_to(n) (n*(n+1))/2
#define pb push_back
#define pf push_front
#define endl "\n"
#define fil(arr,x) memset(arr,x,sizeof(arr))
int dx[8]={0,1,0,-1,1,1,-1,-1};
int dy[8]={1,0,-1,0,1,-1,-1,1};
//-------------------------------------------------------------//
ll lcm(ll a,ll b)
{
return (max(a,b)/__gcd(a,b))*min(a,b);
}
struct segtree{
vector<pair<int,int>>lazy,upd;
int size;
void init(int n){
size=n;
lazy.assign(n*3+5,make_pair(0,100000));
upd.assign(n*3+5,make_pair(0,100000));
}
pair<int,int> merge(int l,int r,int i,int j) {
if (l>=i && r<=j)return make_pair(l,r);
if (i>=l && j<=r)return make_pair(i,j);
if (r<i)return make_pair(i,i);
if (l>j)return make_pair(j,j);
if (r>j)return make_pair(l,j);
else return make_pair(i,r);
}
void push_lazy(int l,int r,int p) {
if (lazy[p]!=make_pair(0,100000)) {
//cout<<upd[p].first<<" :-: "<<upd[p].second<<endl;
upd[p]=merge(upd[p].first,upd[p].second,lazy[p].first,lazy[p].second);
//cout<<upd[p].first<<" :-: "<<upd[p].second<<endl;
//cout<<lazy[p].first<<" ::: "<<lazy[p].second<<endl;
if (l!=r) {
lazy[p*2]=merge(lazy[p*2].first,lazy[p*2].second,lazy[p].first,lazy[p].second);
lazy[p*2+1]=merge(lazy[p*2+1].first,lazy[p*2+1].second,lazy[p].first,lazy[p].second);
}
lazy[p]=make_pair(0,100000);
}
}
void set(int l,int r,int p,int lq,int rq,int a,int b){
push_lazy(l,r,p);
if (r<lq || l>rq)return;
if (l>=lq && r<=rq) {
//cout<<upd[p].first<<" ::: "<<upd[p].second<<endl;
// cout<<l<<" "<<r<<endl;
//cout<<a<<" "<<b<<endl;
lazy[p]=make_pair(a,b);
//cout<<lazy[p].first<<" ::: "<<lazy[p].second<<endl;
push_lazy(l,r,p);
return;
}
int mid=(l+r)/2;
set(l,mid,p*2,lq,rq,a,b);
set(mid+1,r,p*2+1,lq,rq,a,b);
}
void maximize(int l,int r,int x){
set(1,size,1,l,r,x,100000);
}
void minimize(int l,int r,int x){
set(1,size,1,l,r,0,x);
}
int query(int l,int r,int p,int i){
push_lazy(l,r,p);
if (l==r)return upd[p].first;
int mid=(l+r)/2;
if (i<=mid)return query(l,mid,p*2,i);
else return query(mid+1,r,p*2+1,i);
}
int query(int i){
return query(1,size,1,i);
}
};
void buildWall(int n, int k, int op[], int left[], int right[],
int height[], int finalHeight[]) {
segtree sg;
sg.init(n);
for (int i=0;i<k;i++) {
++left[i]; ++right[i];
if (op[i]==1) sg.maximize(left[i],right[i],height[i]);
if (op[i]==2) sg.minimize(left[i],right[i],height[i]);
}
for (int i=0;i<n;i++)
finalHeight[i]=sg.query(i+1);
}
