#include "wall.h"
#include <cstdio>
using namespace std;
struct SMT
{
int mx, mi;
bool amx, ami;
} T[8000010];
int max(int x, int y)
{
return x > y ? x : y;
}
int min(int x, int y)
{
return x < y ? x : y;
}
void build(int k, int l, int r)
{
if (l == r)
{
T[k].mx = 0;
T[k].mi = 0;
T[k].amx = 1;
T[k].ami = 1;
return;
}
int mid = (l + r) >> 1;
build(k * 2, l, mid);
build(k * 2 + 1, mid + 1, r);
T[k].amx = T[k].ami = 0;
return;
}
void pushdown(int k)
{
if (T[k].amx)
{
if (T[k * 2].amx)
T[k * 2].mx = max(T[k * 2].mx, T[k].mx);
else
T[k * 2].amx = 1, T[k * 2].mx = T[k].mx;
if (T[k * 2].ami)
T[k * 2].mi = max(T[k].mx, T[k * 2].mi);
if (T[k * 2 + 1].amx)
T[k * 2 + 1].mx = max(T[k * 2 + 1].mx, T[k].mx);
else
T[k * 2 + 1].amx = 1, T[k * 2 + 1].mx = T[k].mx;
if (T[k * 2 + 1].ami)
T[k * 2 + 1].mi = max(T[k].mx, T[k * 2 + 1].mi);
}
if (T[k].ami)
{
if (T[k * 2].ami)
T[k * 2].mi = min(T[k].mi, T[k * 2].mi);
else
T[k * 2].ami = 1, T[k * 2].mi = T[k].mi;
if (T[k * 2].amx)
T[k * 2].mx = min(T[k].mi, T[k * 2].mx);
if (T[k * 2 + 1].ami)
T[k * 2 + 1].mi = min(T[k].mi, T[k * 2 + 1].mi);
else
T[k * 2 + 1].ami = 1, T[k * 2 + 1].mi = T[k].mi;
if (T[k * 2 + 1].amx)
T[k * 2 + 1].mx = min(T[k].mi, T[k * 2 + 1].mx);
}
T[k].mx = 0;
T[k].amx = 0;
T[k].mi = 0;
T[k].ami = 0;
}
void adding(int k, int l, int r, int x, int y, int height)
{
if (x <= l && r <= y)
{
if (T[k].amx)
T[k].mx = max(height, T[k].mx);
else
T[k].amx = 1, T[k].mx = height;
if (T[k].ami)
T[k].mi = max(height, T[k].mi);
return;
}
int mid = (l + r) >> 1;
pushdown(k);
if (x <= mid)
adding(k * 2, l, mid, x, y, height);
if (mid + 1 <= y)
adding(k * 2 + 1, mid + 1, r, x, y, height);
}
void removing(int k, int l, int r, int x, int y, int height)
{
if (x <= l && r <= y)
{
if (T[k].ami)
T[k].mi = min(height, T[k].mi);
else
T[k].ami = 1, T[k].mi = height;
if (T[k].amx)
T[k].mx = min(height, T[k].mx);
return;
}
int mid = (l + r) >> 1;
pushdown(k);
if (x <= mid)
removing(k * 2, l, mid, x, y, height);
if (mid + 1 <= y)
removing(k * 2 + 1, mid + 1, r, x, y, height);
}
int query(int k, int l, int r, int x)
{
if (l == r && l == x)
{
return T[k].mx;
}
pushdown(k);
int mid = (l + r) >> 1;
if (x <= mid)
return query(k * 2, l, mid, x);
else
return query(k * 2 + 1, mid + 1, r, x);
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[])
{
build(1, 1, n);
for (int i = 0; i < k; i++)
{
if (op[i] == 1)
adding(1, 1, n, left[i] + 1, right[i] + 1, height[i]);
else
removing(1, 1, n, left[i] + 1, right[i] + 1, height[i]);
}
for (int i = 1; i <= n; i++)
finalHeight[i - 1] = query(1, 1, n, i);
return;
}
/*
int n, k, op[500010], left[500010], right[500010], height[2000010], finalHeight[2000010];
int main()
{
scanf("%d%d", &n, &k);
for (int i = 0; i < k; i++)
{
scanf("%d%d%d%d", &op[i], &left[i], &right[i], &height[i]);
}
buildWall(n, k, op, left, right, height, finalHeight);
for (int i = 0; i < n; i++)
{
printf("%d\n", finalHeight[i]);
}
}
*/
