#include "wall.h"
#include <bits/stdc++.h>
using namespace std;
const int MOD = 998244353;
const int MAXN = 2e6 + 10;
struct segtree_beats {
bool cmp(long long x, long long y) { return x > y; }
int stok;
const long long extr = 2e18;
struct node {
long long max1, max2, maxc;
long long min1, min2, minc;
long long lazy, sum;
long long l, r;
};
vector<node> a;
void pushtag_max(int idx, long long val) {
if(val >= a[idx].max1) return;
a[idx].sum -= (a[idx].max1 - val) * a[idx].maxc;
a[idx].max1 = val;
if(a[idx].l == a[idx].r) {
a[idx].min1 = val;
}
else {
if(a[idx].min1 >= val) {
a[idx].min1 = val;
a[idx].min2 = extr;
a[idx].minc = a[idx].r - a[idx].l + 1;
}
else if(a[idx].min2 > val && a[idx].min2 != extr) {
a[idx].min2 = val;
}
}
}
void pushtag_min(int idx, long long val) {
if(val <= a[idx].min1) return;
a[idx].sum += (val - a[idx].min1) * a[idx].minc;
a[idx].min1 = val;
if(a[idx].l == a[idx].r) {
a[idx].max1 = val;
}
else {
if(a[idx].max1 <= val) {
a[idx].max1 = val;
a[idx].max2 = -extr;
a[idx].maxc = a[idx].r - a[idx].l + 1;
}
else if(a[idx].max2 < val && a[idx].max2 != -extr) {
a[idx].max2 = val;
}
}
}
void pushtag_add(int idx, long long val) {
a[idx].max1 += val;
if(a[idx].max2 != -extr) a[idx].max2 += val;
a[idx].min1 += val;
if(a[idx].min2 != extr) a[idx].min2 += val;
a[idx].lazy += val;
a[idx].sum += val * (a[idx].r - a[idx].l + 1);
}
void pushdown(int idx) {
pushtag_add(2*idx+1, a[idx].lazy);
pushtag_add(2*idx+2, a[idx].lazy);
a[idx].lazy = 0;
pushtag_max(2*idx+1, a[idx].max1);
pushtag_max(2*idx+2, a[idx].max1);
pushtag_min(2*idx+1, a[idx].min1);
pushtag_min(2*idx+2, a[idx].min1);
}
void pushup(int idx) {
long long max1, max2, maxc;
long long min1, min2, minc;
long long lazy, sum;
long long l, r;
a[idx].max1 = max(a[2*idx+1].max1, a[2*idx+2].max1);
a[idx].max2 = (a[2*idx+1].max1 == a[2*idx+2].max1 ?
max(a[2*idx+1].max2, a[2*idx+2].max2) :
(a[2*idx+1].max1 < a[2*idx+2].max1 ?
max(a[2*idx+1].max1, a[2*idx+2].max2) :
max(a[2*idx+1].max2, a[2*idx+2].max1)
));
a[idx].maxc = (a[2*idx+1].max1 == a[2*idx+2].max1 ?
a[2*idx+1].maxc + a[2*idx+2].maxc :
(a[2*idx+1].max1 < a[2*idx+2].max1 ?
a[2*idx+2].maxc :
a[2*idx+1].maxc)
);
a[idx].min1 = min(a[2*idx+1].min1, a[2*idx+2].min1);
a[idx].min2 = (a[2*idx+1].min1 == a[2*idx+2].min1 ?
min(a[2*idx+1].min2, a[2*idx+2].min2) :
(a[2*idx+1].min1 > a[2*idx+2].min1 ?
min(a[2*idx+1].min1, a[2*idx+2].min2) :
min(a[2*idx+1].min2, a[2*idx+2].min1)
));
a[idx].minc = (a[2*idx+1].min1 == a[2*idx+2].min1 ?
a[2*idx+1].minc + a[2*idx+2].minc :
(a[2*idx+1].min1 > a[2*idx+2].min1 ?
a[2*idx+2].minc :
a[2*idx+1].minc)
);
a[idx].sum = a[2*idx+1].sum + a[2*idx+2].sum;
}
void init1(int l, int r, int idx, long long val) {
a[idx].l = l, a[idx].r = r;
if(l == r) {
a[idx].max1 = a[idx].min1 = val;
a[idx].max2 = -extr;
a[idx].min2 = extr;
a[idx].maxc = a[idx].minc = 1;
a[idx].lazy = 0;
a[idx].sum = val;
return;
}
int mid = (l+r) >> 1;
init1(l, mid, 2*idx+1, val);
init1(mid+1, r, 2*idx+2, val);
pushup(idx);
}
void u1(int l, int r, int constl, int constr, int idx, long long v) {
if(v >= a[idx].max1) return;
if(l<=constl && constr<=r && v>a[idx].max2) {
pushtag_max(idx, v);
return;
}
pushdown(idx);
int mid = (constl+constr) >> 1;
if(mid < l || r < constl) u1(l, r, mid+1, constr, 2*idx+2, v);
else if(constr < l || r < mid+1) u1(l, r, constl, mid, 2*idx+1, v);
else {
u1(l, r, constl, mid, 2*idx+1, v);
u1(l, r, mid+1, constr, 2*idx+2, v);
}
pushup(idx);
}
void u2(int l, int r, int constl, int constr, int idx, long long v) {
if(v <= a[idx].min1) return;
if(l<=constl && constr<=r && v<a[idx].min2) {
pushtag_min(idx, v);
return;
}
pushdown(idx);
int mid = (constl+constr) >> 1;
if(mid < l || r < constl) u2(l, r, mid+1, constr, 2*idx+2, v);
else if(constr < l || r < mid+1) u2(l, r, constl, mid, 2*idx+1, v);
else {
u2(l, r, constl, mid, 2*idx+1, v);
u2(l, r, mid+1, constr, 2*idx+2, v);
}
pushup(idx);
}
void u3(int l, int r, int constl, int constr, int idx, long long v) {
if(l <= constl && constr <= r) {
pushtag_add(idx, v);
return;
}
pushdown(idx);
int mid = (constl+constr) >> 1;
if(mid < l || r < constl) u3(l, r, mid+1, constr, 2*idx+2, v);
else if(constr < l || r < mid+1) u3(l, r, constl, mid, 2*idx+1, v);
else {
u3(l, r, constl, mid, 2*idx+1, v);
u3(l, r, mid+1, constr, 2*idx+2, v);
}
pushup(idx);
}
long long qu(int l, int r, int constl, int constr, int idx) {
if(l <= constl && constr <= r) {
return a[idx].sum;
}
pushdown(idx);
int mid = (constl+constr) >> 1;
if(mid < l || r < constl) return qu(l, r, mid+1, constr, 2*idx+2);
else if(constr < l || r < mid+1) return qu(l, r, constl, mid, 2*idx+1);
else {
return qu(l, r, constl, mid, 2*idx+1) + qu(l, r, mid+1, constr, 2*idx+2);
}
}
public:
void resize(int k) {
stok = k;
a.resize(4*k + 10);
}
void init(long long v) { // Initialize everything to v
init1(0, stok, 0, v);
}
void min_with(int l, int r, long long v) {
u1(l, r, 0, stok, 0, v);
}
void max_with(int l, int r, long long v) {
u2(l, r, 0, stok, 0, v);
}
void range_add(int l, int r, long long v) {
u3(l, r, 0, stok, 0, v);
}
long long query_sum(int l, int r) {
return (long long)qu(l, r, 0, stok, 0);
}
};
segtree_beats st;
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
st.resize(n);
st.init(0);
for(int i=0; i<k; i++) {
left[i] = left[i] + 1;
right[i] = right[i] + 1;
if(op[i] == 1) {
st.max_with(left[i], right[i], height[i]);
}
else {
st.min_with(left[i], right[i], height[i]);
}
}
for(int i=0; i<n; i++) finalHeight[i] = st.query_sum(i+1, i+1);
}
