#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
const int N = 1e6;
pair<int, int> tree[4*N + 5], lazy[4*N + 5];
pair<int, int> combine(pair<int, int>f, pair<int, int>se) {
int a = max(f.first, se.first), b = min(f.second, se.second);
if (b < a) {
if (se.second < f.first) return pair<int, int>(se.second, se.second);
else return pair<int, int>(se.first, se.first);
} else {
return pair<int, int>(a, b);
}
}
void push(int v) {
tree[v*2] = combine(tree[v*2], lazy[v]), tree[v*2 + 1] = combine(tree[v*2 + 1], lazy[v]);
lazy[v*2] = combine(lazy[v*2], lazy[v]), lazy[v*2 + 1] = combine(lazy[v*2 + 1], lazy[v]);
lazy[v] = {-1e9, 1e9};
}
void update(int v, int tl, int tr, int l, int r, pair<int, int> x) {
if (l > r) return;
else if (tl == l && tr == r) tree[v] = combine(tree[v], x), lazy[v] = combine(lazy[v], x);
else {
push(v);
int tm = (tl + tr)/2;
update(v*2, tl, tm, l, min(tm, r), x);
update(v*2 + 1, tm + 1, tr, max(l, tm + 1), r, x);
}
}
pair<int, int> query(int v, int tl, int tr, int k) {
if (tl == tr) return tree[v];
else {
push(v);
int tm = (tl + tr)/2;
if (k <= tm) return query(v*2, tl, tm, k);
else return query(v*2 + 1, tm + 1, tr, k);
}
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
for (int i = 1; i <= 4*N; i++) tree[i] = lazy[i] = {-1e9, 1e9};
for (int i = 0; i < k; i++) {
int l = left[i], r = right[i], type = op[i], h = height[i];
if (type == 1) {
update(1, 0, n - 1, l, r, {h, 1e9});
} else {
update(1, 0, n - 1, l, r, {-1e9, h});
}
}
for (int i = 0; i < n; i++) {
pair<int, int> ans = query(1, 0, n - 1, i);
//cout << ans.first << " " << ans.second << '\n';
finalHeight[i] = max(0, ans.first);
}
}
/*int main()
{
int n;
int k;
int i, j;
int status = 0;
cin >> n >> k;
int* op = (int*)calloc(sizeof(int), k);
int* left = (int*)calloc(sizeof(int), k);
int* right = (int*)calloc(sizeof(int), k);
int* height = (int*)calloc(sizeof(int), k);
int* finalHeight = (int*)calloc(sizeof(int), n);
for (i = 0; i < k; i++){
cin >> op[i] >> left[i] >> right[i] >> height[i];
// status = scanf("%d%d%d%d", &op[i], &left[i], &right[i], &height[i]);
// assert(status == 4);
}
buildWall(n, k, op, left, right, height, finalHeight);
for (j = 0; j < n; j++)
//printf("%d\n", finalHeight[j]);
cout << finalHeight[j] << '\n';
return 0;
}*/
