#include <bits/stdc++.h>
#include "wall.h"
using namespace std;
#define ff first
#define ss second
const int inf = 1e9;
const int K = 5e5;
int amn[4*K],amx[4*K];
int pos[K];
void build(int p,int l,int r)
{
if(l == r)pos[l] = p;
else
{
int m = (l + r) / 2;
build(p*2,l,m);
build(p*2+1,m+1,r);
}
amn[p] = 0;
amx[p] = inf;
return ;
}
void change(int p)
{
if(p == 0)return ;
int mx = min(amx[p*2],amx[p*2+1]);
int mn = max(amn[p*2],amn[p*2+1]);
if(mn > mx)
{
if(mn == amn[p*2+1])mx = mn;
else mn = mx;
}
amn[p] = mn;
amx[p] = mx;
change(p / 2);
return ;
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[])
{
queue<int> vq[n+1];
build(1,0,k-1);
for(int i = 0;i < k;i++)vq[left[i]].push(i);
for(int i = 0;i < k;i++)vq[right[i]+1].push(i);
for(int i = 0;i < n;i++)
{
while(!vq[i].empty())
{
int v = vq[i].front();
vq[i].pop();
if(amn[pos[v]] == 0 && amx[pos[v]] == inf)
{
if(op[v] == 1)amn[pos[v]] = height[v];
else amx[pos[v]] = height[v];
}
else
{
amn[pos[v]] = 0;
amx[pos[v]] = inf;
}
change(pos[v] / 2);
}
finalHeight[i] = amn[1];
}
return ;
}
