#include "wall.h"
#include <bits/stdc++.h>
// #include <ext/rope>
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
// using namespace __gnu_cxx;
using namespace std;
// #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define ll long long
#define ull unsigned long long
#define ld long double
#define pb push_back
#define bit(mask, i) ((mask >> i) & 1)
#define el '\n'
#define F first
#define S second
// template <class X, class Y> bool maximize(X &x, const Y &y) { return (x < y ? x = y, 1 : 0); }
// template <class X, class Y> bool minimize(X &x, const Y &y) { return (x > y ? x = y, 1 : 0); }
const int INF = 1e9;
const ll LINF = 1e18;
const int MOD = 1e9 + 7;
const int MULTI = 0;
const ld eps = 1e-9;
const int dx[4] = {0, 1, 0, -1}, dy[4] = {1, 0, -1, 0}; // R D L U
const int ddx[4] = {-1, 1, 1, -1}, ddy[4] = {1, 1, -1, -1}; // UR DR DL UL
const char cx[4] = {'R', 'D', 'L', 'U'};
const int nMOD = 2;
const ll mods[] = {(ll)1e9 + 10777, (ll)1e9 + 19777, (ll)1e9 + 3, (ll)1e9 + 3777};
const pair<int, int> base = make_pair(INF, -INF);
void minimize(pair<int, int> &A, int t) {
A.F = min(A.F, t);
A.S = min(A.F, A.S);
}
void maximize(pair<int, int> &A, int t) {
A.S = max(A.S, t);
A.F = max(A.S, A.F);
}
const int maxn = 2e6 + 5;
int a[maxn];
struct IT {
pair<int, int> st[4 * maxn], lz[4 * maxn];
void build(int id, int l, int r) {
if (l == r) return st[id] = lz[id] = base, void();
int mid = (l + r) >> 1;
build(id << 1, l, mid);
build(id << 1 | 1, mid + 1, r);
st[id] = st[id << 1];
minimize(st[id], st[id << 1 | 1].F);
maximize(st[id], st[id << 1 | 1].S);
}
void push(int id) {
pair<int, int> &t = lz[id];
if (t == base) return;
minimize(st[id << 1], t.F);
maximize(st[id << 1], t.S);
minimize(lz[id << 1], t.F);
maximize(lz[id << 1], t.S);
minimize(st[id << 1 | 1], t.F);
maximize(st[id << 1 | 1], t.S);
minimize(lz[id << 1 | 1], t.F);
maximize(lz[id << 1 | 1], t.S);
t = base;
}
void update(int id, int l, int r, int u, int v, int t, int type) {
if (l == u && r == v) {
if (type == 2) {
minimize(st[id], t);
minimize(lz[id], t);
} else {
maximize(st[id], t);
maximize(lz[id], t);
}
return;
}
int mid = (l + r) >> 1; push(id);
if (v <= mid) update(id << 1, l, mid, u, v, t, type);
else if (u > mid) update(id << 1 | 1, mid + 1, r, u, v, t, type);
else {
update(id << 1, l, mid, u, mid, t, type);
update(id << 1 | 1, mid + 1, r, mid + 1, v, t, type);
}
st[id] = st[id << 1];
minimize(st[id], st[id << 1 | 1].F);
maximize(st[id], st[id << 1 | 1].S);
}
pair<int, int> get(int id, int l, int r, int u, int v) {
if (l == u && r == v) return st[id];
int mid = (l + r) >> 1; push(id);
if (v <= mid) return get(id << 1, l, mid, u, v);
else if (u > mid) return get(id << 1 | 1, mid + 1, r, u, v);
else {
pair<int, int> L = get(id << 1, l, mid, u, mid);
pair<int, int> R = get(id << 1 | 1, mid + 1, r, mid + 1, v);
minimize(L, R.F); maximize(L, R.S);
return L;
}
}
} IT;
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]) {
IT.build(1, 1, n);
for (int i = 0; i < k; ++i)
IT.update(1, 1, n, left[i] + 1, right[i] + 1, height[i], op[i]);
for (int i = 0; i < n; ++i) {
pair<int, int> get = IT.get(1, 1, n, i + 1, i + 1);
finalHeight[i] = get.S;
}
return;
}
