#include "wall.h"
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#define M_PI 3.14159265358979323846
#define FILER 0
using ll = int;
using ull = unsigned long long;
using ld = long double;
const ll MOD = pow(10, 9) + 7;
const ll INFL = 0x3f3f3f3f3f3f3f3f;
const ull INFUL = 0x3f3f3f3f3f3f3f3f;
const ll INFT = 0x3f3f3f3f;
const ull MAX = 1LL << 24;
const ll MODD = 998244353;
const double EPS = 1e-10;
#define V vector
#define pll pair<ll, ll>
#define pull2 pair<ull,ull>
#define MS multiset
#define M map
#define Q queue
#define PQ priority_queue
#define IOF ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define FOR(typ,i,a,b,c) for(typ i = a; i < b; i += c)
#define FORR(typ,i,a,b,c) for(typ i = a; i > b; i -= c)
#define FORA(a,i) for(auto &i : a)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define sorta(a) sort(all(a))
#define sortd(a) sort(all(a), greater<ll>())
#define setp(x) setprecision(x)<<fixed
#define RET return
#define log(a,b) log(b)/log(a)
#define WH(s) while(s)
#define WHI(t) WH(t--)
#define YES cout<<"YES"<<endl;
#define NO cout<<"NO"<<endl;
#define Yes cout<<"Yes"<<endl;
#define No cout<<"No"<<endl;
#define YESNO(s) cout << (s ? "YES" : "NO") << endl;
#define YesNo(s) cout<<(s?"Yes":"No")<<endl;
#define TYP 0
using namespace std;
struct node
{
ll mx, smx, cmx, mn, smn, cmn;
};
V<node> st;
ll n, q, c, l, r, h;
void merge(ll u)
{
if (st[u << 1].mx == st[u << 1 | 1].mx)
{
st[u].cmx = st[u << 1].cmx + st[u << 1 | 1].cmx;
st[u].mx = st[u << 1].mx;
st[u].smx = max(st[u << 1].smx, st[u << 1 | 1].smx);
}
else
{
st[u].mx = max(st[u << 1].mx, st[u << 1 | 1].mx);
if (st[u << 1].mx > st[u << 1 | 1].mx)
{
st[u].smx = max(st[u << 1].smx, st[u << 1 | 1].mx);
st[u].cmx = st[u << 1].cmx;
}
else
{
st[u].smx = max(st[u << 1 | 1].smx, st[u << 1].mx);
st[u].cmx = st[u << 1 | 1].cmx;
}
}
if (st[u << 1].mn == st[u << 1 | 1].mn)
{
st[u].cmn = st[u << 1].cmn + st[u << 1 | 1].cmn;
st[u].mn = st[u << 1].mn;
st[u].smn = min(st[u << 1].smn, st[u << 1 | 1].smn);
}
else
{
st[u].mn = min(st[u << 1].mn, st[u << 1 | 1].mn);
if (st[u << 1].mn < st[u << 1 | 1].mn)
{
st[u].smn = min(st[u << 1].smn, st[u << 1 | 1].mn);
st[u].cmn = st[u << 1].cmn;
}
else
{
st[u].smn = min(st[u << 1 | 1].smn, st[u << 1].mn);
st[u].cmn = st[u << 1 | 1].cmn;
}
}
}
void push_min(ll u, ll h, ll l, ll r)
{
if (h <= st[u].mn)RET;
st[u].mn = h;
if (l == r)st[u].mx = st[u].mn;
else
{
if (st[u].mx <= h)st[u].mx = h;
else if (st[u].smx < h)st[u].smx = h;
}
}
void push_max(ll u, ll h, ll l, ll r)
{
if (h >= st[u].mx)RET;
st[u].mx = h;
if (l == r)st[u].mn = st[u].mx;
else
{
if (st[u].mn >= h)st[u].mn = h;
else if (st[u].smn > h)st[u].smn = h;
}
}
void push_down(ll u, ll l, ll r)
{
ll m = (l + r) >> 1;
push_max(u << 1, st[u].mx, l, m); push_max(u << 1 | 1, st[u].mx, m + 1, r);
push_min(u << 1, st[u].mn, l, m); push_min(u << 1 | 1, st[u].mn, m + 1, r);
}
void add(ll u, ll l, ll r, ll ql, ll qr, ll h)
{
if (l > r || qr < l || ql > r || st[u].mn >= h) RET;
if (ql <= l && r <= qr && st[u].smn > h)
{
push_min(u, h, l, r);
RET;
}
push_down(u, l, r);
ll m = (l + r) >> 1;
add(u << 1, l, m, ql, qr, h); add(u << 1 | 1, m + 1, r, ql, qr, h);
merge(u);
}
void sub(ll u, ll l, ll r, ll ql, ll qr, ll h)
{
if (l > r || qr < l || ql > r || st[u].mx <= h) RET;
if (ql <= l && r <= qr && st[u].smx < h)
{
push_max(u, h, l, r);
RET;
}
push_down(u, l, r);
ll m = (l + r) >> 1;
sub(u << 1, l, m, ql, qr, h); sub(u << 1 | 1, m + 1, r, ql, qr, h);
merge(u);
}
ll get(ll u, ll l, ll r, ll p)
{
if (l > r)RET 0;
if (l == r)
RET st[u].mn;
push_down(u, l, r);
ll m = (l + r) >> 1;
if (p <= m)RET get(u << 1, l, m, p);
RET get(u << 1 | 1, m + 1, r, p);
}
void build(ll u, ll l, ll r)
{
if (l == r) { st[u].mx = st[u].mn = 0; st[u].smx = -INFL, st[u].smn = INFL; st[u].cmn = st[u].cmx = 1; RET; }
ll m = (l + r) >> 1;
build(u << 1, l, m); build(u << 1 | 1, m + 1, r);
merge(u);
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
st.resize(4 * n + 4);
build(1, 0, n - 1);
FOR(ll, i, 0, k, 1)
{
if (op[i]==1) add(1, 0, n-1, left[i], right[i], height[i]);
else sub(1, 0, n - 1, left[i], right[i], height[i]);
}
FOR(ll, i, 0, n, 1)finalHeight[i] = get(1, 0, n - 1, i);
}
