#include "wall.h"
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define eb emplace_back
#define pb push_back
#define ft first
#define sd second
#define pi pair<int, int>
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define dbg(...) dbg_out(__VA_ARGS__)
using ll = long long;
using ld = long double;
using namespace std;
using namespace __gnu_pbds;
//Constants
const ll INF = 5 * 1e18;
const int IINF = 2 * 1e9;
const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const ld PI = 3.14159265359;
//Templates
template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) {return os << '(' << p.first << ", " << p.second << ')';}
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) {os << '['; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << ']';}
void dbg_out() {cerr << endl;}
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << H << ' '; dbg_out(T...); }
template<typename T> void mins(T& x, T y) {x = min(x, y);}
template<typename T> void maxs(T& x, T y) {x = max(x, y);}
template<typename T> using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T> using omset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
//order_of_key(k): number of elements strictly less than k
//find_by_order(k): k-th element in the set
void setPrec() {cout << fixed << setprecision(15);}
void unsyncIO() {cin.tie(0)->sync_with_stdio(0);}
void setIn(string s) {freopen(s.c_str(), "r", stdin);}
void setOut(string s) {freopen(s.c_str(), "w", stdout);}
void setIO(string s = "") {
unsyncIO(); setPrec();
if(s.size()) setIn(s + ".in"), setOut(s + ".out");
}
// #define TEST_CASES
struct SegmentTree {
struct Node {
int mx, mn;
};
vector<Node> tre;
const int NO_OPERATION = 0;
const int NEUTRAL = IINF;
int sz;
SegmentTree(int n) {
sz = 1;
while (sz < n) sz *= 2;
tre.assign(2 * sz, {0, IINF});
}
void propagate(int x, int lx, int rx) {
if (rx - lx == 1) return;
maxs(tre[2 * x].mx, tre[x].mx);
maxs(tre[2 * x].mn, tre[x].mx);
mins(tre[2 * x].mn, tre[x].mn);
mins(tre[2 * x].mx, tre[x].mn);
maxs(tre[2 * x + 1].mn, tre[x].mx);
maxs(tre[2 * x + 1].mx, tre[x].mx);
mins(tre[2 * x + 1].mn, tre[x].mn);
mins(tre[2 * x + 1].mx, tre[x].mn);
tre[x].mx = 0; tre[x].mn = IINF;
}
void set(int l, int r, int op, int v, int x, int lx, int rx) {
propagate(x, lx, rx);
if (rx <= l || lx >= r) {
return;
}
if (l <= lx && r >= rx) {
if (op == 1) {
maxs(tre[x].mx, v);
maxs(tre[x].mn, v);
} else {
mins(tre[x].mn, v);
mins(tre[x].mx, v);
}
return;
}
int m = (lx + rx) / 2;
set(l, r, op, v, 2 * x, lx, m);
set(l, r, op, v, 2 * x + 1, m, rx);
}
void set(int l, int r, int op, int v) {
set(l, r, op, v, 1, 0, sz);
}
int get(int i, int x, int lx, int rx) {
propagate(x, lx, rx);
if (rx - lx == 1) {
return tre[x].mx;
}
int m = (lx + rx) / 2;
if (i < m) {
return get(i, 2 * x, lx, m);
} else {
return get(i, 2 * x + 1, m, rx);
}
}
int get(int i) {
return get(i, 1, 0, sz);
}
};
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
SegmentTree st(n);
for (int i = 0; i < k; i++) {
st.set(left[i], right[i] + 1, op[i], height[i]);
}
for (int i = 0; i < n; i++) {
finalHeight[i] = st.get(i);
}
}
