#include <bits/stdc++.h>
#include "wall.h"
using namespace std;
#define ff first
#define ss second
#define pii pair<int, int>
vector<int> st;
vector<pair<pii, pii>> lz;
void Lz(int nd, pii p) {
if ((lz[nd].ff.ff == 1 && p.ff == 1 && lz[nd].ff.ss <= p.ss) || (lz[nd].ff.ff == 2 && p.ff == 2 && lz[nd].ff.ss >= p.ss)) lz[nd].ff = {-1, -1};
if ((lz[nd].ss.ff == 1 && p.ff == 1 && lz[nd].ss.ss <= p.ss) || (lz[nd].ss.ff == 2 && p.ff == 2 && lz[nd].ss.ss >= p.ss)) lz[nd].ss = {-1, -1};
if (lz[nd].ff == (pii){-1, -1}) swap(lz[nd].ff, lz[nd].ss);
if (lz[nd].ff.ff == p.ff || lz[nd].ss.ff == p.ff) return;
if (lz[nd].ff == (pii){-1, -1}) lz[nd].ff = p;
else if (lz[nd].ss == (pii){-1, -1}) lz[nd].ss = p;
if (lz[nd].ss != (pii){-1, -1}) {
if (lz[nd].ff.ff == 2) lz[nd].ff.ss = max(lz[nd].ff.ss, lz[nd].ss.ss);
else lz[nd].ff.ss = min(lz[nd].ff.ss, lz[nd].ss.ss);
}
}
void LZ(int nd, int l, int r) {
if (lz[nd].ff.ff == 1) st[nd] = max(st[nd], lz[nd].ff.ss);
else if (lz[nd].ff.ff == 2) st[nd] = min(st[nd], lz[nd].ff.ss);
if (lz[nd].ss.ff == 1) st[nd] = max(st[nd], lz[nd].ss.ss);
else if (lz[nd].ss.ff == 2) st[nd] = min(st[nd], lz[nd].ss.ss);
if (l < r) {
int ch = (nd << 1) + 1;
if (lz[nd].ff != (pii){-1, -1}) {
Lz(ch, lz[nd].ff); Lz(ch + 1, lz[nd].ff);
}
if (lz[nd].ss != (pii){-1, -1}) {
Lz(ch, lz[nd].ss); Lz(ch + 1, lz[nd].ss);
}
}
lz[nd].ff = lz[nd].ss = {-1, -1};
}
int upd(int nd, int l, int r, int x, int y, int op, int h) {
LZ(nd, l, r);
if (r < x || y < l) return st[nd];
if (x <= l && r <= y) {
Lz(nd, {op, h}); LZ(nd, l, r);
return st[nd];
}
int ch = (nd << 1) + 1, md = (l + r) >> 1;
return st[nd] = max(upd(ch, l, md, x, y, op, h), upd(ch + 1, md + 1, r, x, y, op, h));
}
int fnd(int nd, int l, int r, int x) {
LZ(nd, l, r);
if (r < x || x < l) return 0;
if (l == r) return st[nd];
int ch = (nd << 1) + 1, md = (l + r) >> 1;
return max(fnd(ch, l, md, x), fnd(ch + 1, md + 1, r, x));
}
void buildWall(int n, int k, int op[], int l[], int r[], int h[], int fh[]) {
st.assign(n << 2, 0);
lz.assign(n << 2, {});
for (auto &i : lz) {
i.ff = i.ss = {-1, -1};
}
for (int i = 0; i < k; i++) {
upd(0, 0, n - 1, l[i], r[i], op[i], h[i]);
}
for (int i = 0; i < n; i++) {
fh[i] = fnd(0, 0, n - 1, i);
}
}
