#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O2")
#include <bits/stdc++.h>
#define L(i) i*2+1
#define R(i) i*2+2
using namespace std;
typedef pair<int, int> pii;
pii *tree, *lazy;
pii update(int i, int l, int r, int a, int b, const pii& op){
if(lazy[i].first != -1){
tree[i].first = min(max(tree[i].first, lazy[i].first), lazy[i].second);
tree[i].second = max(min(tree[i].second, lazy[i].second), lazy[i].first);
if(l != r) {
lazy[L(i)] = lazy[R(i)] = {tree[i].first, tree[i].second};
}
lazy[i] = {-1, -1};
}
if(l > b || r < a) return tree[i];
if(a <= l && r <= b){
if(op.first == 1){
tree[i].first = max(tree[i].first, op.second);
if(tree[i].first > tree[i].second){
tree[i].second = tree[i].first;
}
} else {
tree[i].second = min(tree[i].second, op.second);
if(tree[i].first > tree[i].second){
tree[i].first = tree[i].second;
}
}
if(l != r) lazy[L(i)] = lazy[R(i)] = tree[i];
}
else if(l != r){
int mid = (l+r)/2;
pii left = update(L(i), l, mid, a, b, op), right = update(R(i), mid+1, r, a, b, op);
tree[i] = {min(left.first, right.first), max(left.second, right.second)};
}
return tree[i];
}
void get(int i, int l, int r, int finalHeight[]){
if(lazy[i].first != -1){
tree[i].first = min(max(tree[i].first, lazy[i].first), lazy[i].second);
tree[i].second = max(min(tree[i].second, lazy[i].second), lazy[i].first);
if(l != r) {
lazy[L(i)] = lazy[R(i)] = {tree[i].first, tree[i].second};
}
lazy[i] = {-1, -1};
}
if(l == r){
finalHeight[l] = tree[i].first;
} else {
int mid = (l+r)/2;
get(L(i), l, mid, finalHeight);
get(R(i), mid+1, r, finalHeight);
}
}
void buildWall(int n, int k, int op[], int left[], int right[],int height[], int finalHeight[]){
tree = new pii[4 * n + 10];
lazy = new pii[4 * n + 10];
for(int i = 0;i < 4*n+10;i++) {
lazy[i] = {-1, -1};
tree[i] = {0, 0};
}
//printf("hi\n");
for(int i = 0;i < k;i++){
update(0, 0, n-1, left[i], right[i], {op[i], height[i]});
}
get(0, 0, n-1, finalHeight);
delete[] tree;
delete[] lazy;
}
