#include <bits/stdc++.h>
#include "wall.h"
using namespace std;
using ll = long long;
const int MAXN = 200001; // 1-based
int N;
ll A[MAXN];
struct Node {
ll sum; // Sum tag
ll max1; // Max value
ll max2; // Second Max value
ll maxc; // Max value count
ll min1; // Min value
ll min2; // Second Min value
ll minc; // Min value count
ll lazy; // Lazy tag
} T[MAXN * 4];
void merge(int t) {
// sum
T[t].sum = T[t << 1].sum + T[t << 1 | 1].sum;
// max
if (T[t << 1].max1 == T[t << 1 | 1].max1) {
T[t].max1 = T[t << 1].max1;
T[t].max2 = max(T[t << 1].max2, T[t << 1 | 1].max2);
T[t].maxc = T[t << 1].maxc + T[t << 1 | 1].maxc;
} else {
if (T[t << 1].max1 > T[t << 1 | 1].max1) {
T[t].max1 = T[t << 1].max1;
T[t].max2 = max(T[t << 1].max2, T[t << 1 | 1].max1);
T[t].maxc = T[t << 1].maxc;
} else {
T[t].max1 = T[t << 1 | 1].max1;
T[t].max2 = max(T[t << 1].max1, T[t << 1 | 1].max2);
T[t].maxc = T[t << 1 | 1].maxc;
}
}
// min
if (T[t << 1].min1 == T[t << 1 | 1].min1) {
T[t].min1 = T[t << 1].min1;
T[t].min2 = min(T[t << 1].min2, T[t << 1 | 1].min2);
T[t].minc = T[t << 1].minc + T[t << 1 | 1].minc;
} else {
if (T[t << 1].min1 < T[t << 1 | 1].min1) {
T[t].min1 = T[t << 1].min1;
T[t].min2 = min(T[t << 1].min2, T[t << 1 | 1].min1);
T[t].minc = T[t << 1].minc;
} else {
T[t].min1 = T[t << 1 | 1].min1;
T[t].min2 = min(T[t << 1].min1, T[t << 1 | 1].min2);
T[t].minc = T[t << 1 | 1].minc;
}
}
}
void push_add(int t, int tl, int tr, ll v) {
if (v == 0) {
return;
}
T[t].sum += (tr - tl + 1) *v;
T[t].max1 += v;
if (T[t].max2 != -llINF) {
T[t].max2 += v;
}
T[t].min1 += v;
if (T[t].min2 != llINF) {
T[t].min2 += v;
}
T[t].lazy += v;
}
// corresponds to a chmin update
void push_max(int t, ll v, bool l) {
if (v >= T[t].max1) {
return;
}
T[t].sum -= T[t].max1 * T[t].maxc;
T[t].max1 = v;
T[t].sum += T[t].max1 * T[t].maxc;
if (l) {
T[t].min1 = T[t].max1;
} else {
if (v <= T[t].min1) {
T[t].min1 = v;
} else if (v < T[t].min2) {
T[t].min2 = v;
}
}
}
// corresponds to a chmax update
void push_min(int t, ll v, bool l) {
if (v <= T[t].min1) {
return;
}
T[t].sum -= T[t].min1 * T[t].minc;
T[t].min1 = v;
T[t].sum += T[t].min1 * T[t].minc;
if (l) {
T[t].max1 = T[t].min1;
} else {
if (v >= T[t].max1) {
T[t].max1 = v;
} else if (v > T[t].max2) {
T[t].max2 = v;
}
}
}
void pushdown(int t, int tl, int tr) {
if (tl == tr)
return;
// sum
int tm = (tl + tr) >> 1;
push_add(t << 1, tl, tm, T[t].lazy);
push_add(t << 1 | 1, tm + 1, tr, T[t].lazy);
T[t].lazy = 0;
// max
push_max(t << 1, T[t].max1, tl == tm);
push_max(t << 1 | 1, T[t].max1, tm + 1 == tr);
// min
push_min(t << 1, T[t].min1, tl == tm);
push_min(t << 1 | 1, T[t].min1, tm + 1 == tr);
}
void build(int t=1, int tl=0, int tr=N-1) {
T[t].lazy = 0;
if (tl == tr) {
T[t].sum = T[t].max1 = T[t].min1 = A[tl];
T[t].maxc = T[t].minc = 1;
T[t].max2 = -llINF;
T[t].min2 = llINF;
return;
}
int tm = (tl + tr) >> 1;
build(t << 1, tl, tm);
build(t << 1 | 1, tm + 1, tr);
merge(t);
}
void update_add(int l, int r, ll v, int t=1, int tl=0, int tr=N-1) {
if (r < tl || tr < l) {
return;
}
if (l <= tl && tr <= r) {
push_add(t, tl, tr, v);
return;
}
pushdown(t, tl, tr);
int tm = (tl + tr) >> 1;
update_add(l, r, v, t << 1, tl, tm);
update_add(l, r, v, t << 1 | 1, tm + 1, tr);
merge(t);
}
void update_chmin(int l, int r, ll v, int t=1, int tl=0, int tr=N-1) {
if (r < tl || tr < l || v >= T[t].max1) {
return;
}
if (l <= tl && tr <= r && v > T[t].max2) {
push_max(t, v, tl == tr);
return;
}
pushdown(t, tl, tr);
int tm = (tl + tr) >> 1;
update_chmin(l, r, v, t << 1, tl, tm);
update_chmin(l, r, v, t << 1 | 1, tm + 1, tr);
merge(t);
}
void update_chmax(int l, int r, ll v, int t=1, int tl=0, int tr=N-1) {
if (r < tl || tr < l || v <= T[t].min1) {
return;
}
if (l <= tl && tr <= r && v < T[t].min2) {
push_min(t, v, tl == tr);
return;
}
pushdown(t, tl, tr);
int tm = (tl + tr) >> 1;
update_chmax(l, r, v, t << 1, tl, tm);
update_chmax(l, r, v, t << 1 | 1, tm + 1, tr);
merge(t);
}
ll query_sum(int l, int r, int t=1, int tl=0, int tr=N-1) {
if (r < tl || tr < l) {
return 0;
}
if (l <= tl && tr <= r) {
return T[t].sum;
}
pushdown(t, tl, tr);
int tm = (tl + tr) >> 1;
return query_sum(l, r, t << 1, tl, tm) + query_sum(l, r, t << 1 | 1, tm + 1, tr);
}
void buildWall(int n, int k, int op[], int left[], int right[], int height[], int finalHeight[]){
for (int x = 0; x < n; x++) A[x] = 0;
N = n;
build();
for (int x = 0; x < k; x++){
if (op[x] == 1) update_chmax(left[x], right[x], height[x]);
else update_chmin(left[x], right[x], height[x]);
}
for (int x = 0; x < n; x++) finalHeight[x] = query_sum(x, x);
}
/*
int main() {
int Q;
cin >> N >> Q;
for (int i = 0; i < N; i++) {
cin >> A[i];
}
build();
for (int q = 0; q < Q; q++) {
int t; cin >> t;
if (t == 0) {
int l, r;
ll x;
cin >> l >> r >> x;
update_chmin(l, r, x);
} else if (t == 1) {
int l, r;
ll x;
cin >> l >> r >> x;
update_chmax(l, r, x);
} else if (t == 2) {
int l, r;
ll x;
cin >> l >> r >> x;
update_add(l, r, x);
} else if (t == 3) {
int l, r;
cin >> l >> r;
cout << query_sum(l, r) << '\n';
}
}
}
*/
Compilation message
wall.cpp: In function 'void push_add(int, int, int, ll)':
wall.cpp:67:20: error: 'llINF' was not declared in this scope
67 | if (T[t].max2 != -llINF) {
| ^~~~~
wall.cpp:71:19: error: 'llINF' was not declared in this scope
71 | if (T[t].min2 != llINF) {
| ^~~~~
wall.cpp: In function 'void build(int, int, int)':
wall.cpp:138:16: error: 'llINF' was not declared in this scope
138 | T[t].max2 = -llINF;
| ^~~~~
