#include <bits/stdc++.h>
#define endl '\n'
using namespace std;
const int MAXN = 1e5 + 10;
int nn, kk;
int lazy_max[4 * MAXN], lazy_min[4 * MAXN];
int add[MAXN], rem[MAXN];
int ql, qr, h;
/*void update_maxx(int i, int l, int r)
{
if(ql <= l && r <= qr)
{
if(lazy_max[i] == -1)lazy_max[i] = h;
else lazy_max[i] = max(lazy_max[i], h);
return;
}
if(ql > r || qr < l)
return;
int mid = (l + r)/2;
update_maxx(2*i, l, mid);
update_maxx(2*i+1, mid+1, r);
}*/
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[])
{
if(n <= 10000)
{
for (int i = 0; i < k; ++ i)
{
for (int j = left[i]; j <= right[i]; ++ j)
{
if(op[i] == 1)finalHeight[j] = max(finalHeight[j], height[i]);
else finalHeight[j] = min(finalHeight[j], height[i]);
}
}
return;
}
}
