#include <vector>
#include <algorithm>
#include <iostream>
#include <set>
#include <cmath>
#include <map>
#include <random>
#include <cassert>
#include <ctime>
#include <cstdlib>
#include <limits.h>
using namespace std;
const int MOD = 1e9;
class Node {
public:
pair<int64_t,int64_t> lval;
pair<int64_t,int64_t> rval;
int monotone = 1;
int64_t tot = 0;
};
void update (Node& x, int val) {
if (x.monotone == -1) {
x.tot = 0;
x.rval = x.lval = {val, val};
x.monotone = true;
} else {
x.lval.first += val;
x.lval.second += val;
x.rval.first += val;
x.rval.second += val;
}
}
Node merge (Node left, Node right) {
if (left.monotone == -1) {
return right;
}
if (right.monotone == -1) {
return left;
}
Node ans;
ans.tot = left.tot + right.tot;
ans.lval = left.lval;
ans.rval = right.rval;
if (left.monotone && right.monotone && left.rval.second <= right.lval.first) {
ans.tot -= (left.rval.second - left.rval.first);
ans.tot -= (right.lval.second - right.lval.first);
ans.lval = ans.rval = {left.rval.first, right.lval.second};
ans.tot += ans.lval.second - ans.lval.first;
ans.monotone = true;
return ans;
}
ans.monotone = false;
if (left.monotone && left.rval.second <= right.lval.first) {
ans.tot -= (left.rval.second - left.rval.first);
ans.tot -= (right.lval.second - right.lval.first);
ans.lval = {left.rval.first, right.lval.second};
ans.tot += ans.lval.second - ans.lval.first;
}
if (right.monotone && left.rval.second <= right.lval.first) {
ans.tot -= (left.rval.second - left.rval.first);
ans.tot -= (right.lval.second - right.lval.first);
ans.rval = {left.rval.first, right.lval.second};
ans.tot += ans.rval.second - ans.rval.first;
}
ans.monotone = false;
return ans;
}
Node INF = {{-1, -1}, {-1, -1}, -1, -1};
struct segmentTree {
vector<Node> vec;
vector<int64_t> addLater;
void push (int v) {
addLater[2 * v + 1] += addLater[v];
addLater[2 * v] += addLater[v];
update(vec[2 * v + 1], addLater[v]);
update(vec[2 * v], addLater[v]);
addLater[v] = 0;
}
void upd(int dum, int tl, int tr, int l, int r, int64_t val) {
if (tr < l || tl > r) {
return;
}
if (tl >= l && tr <= r) {
addLater[dum] += val;
update(vec[dum], val);
return;
}
push(dum);
int mid = (tl + tr) >> 1;
upd(2 * dum, tl, mid, l, r, val);
upd(2 * dum + 1, mid + 1, tr, l, r, val);
vec[dum] = merge(vec[2 * dum], vec[2 * dum + 1]);
}
void upd(int l, int r, int val) {
upd(1, 0, (int) vec.size() / 2 - 1, l, r, val);
}
Node get(int dum, int tl, int tr, int &l, int &r) {
if (tl > r || tr < l) {
return INF;
}
if (tl >= l && tr <= r) {
return vec[dum];
}
push(dum);
int tm = (tl + tr) >> 1;
return merge(get(dum * 2, tl, tm, l, r), get(dum * 2 + 1, tm + 1, tr, l, r));
}
Node get(int l, int r) {
return get(1, 0, (int) vec.size() / 2 - 1, l, r);
}
void resz(int n) {
int sz = ((1 << (int) ceil(log2(n))));
vec.assign(sz * 2, INF);
addLater.resize(sz * 2);
}
};
int main() {
//freopen("seating.in", "r", stdin);
//freopen("haybales.out", "w", stdout);
ios_base::sync_with_stdio(false);
INF.monotone = -1;
cin.tie(NULL);
int N, D;
cin >> N >> D;
segmentTree st;
st.resz(N);
for (int i = 0; i < N; i++) {
int x; cin >> x;
st.upd(i, i, x);
}
cout << st.get(0, N - 1).tot << '\n';
//return 0;
while (D--) {
int l, r, x;
cin >> l >> r >> x;
l--, r--;
st.upd(l, r, x);
cout << st.get(0, N - 1).tot << '\n';
}
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
| 2 |
Halted |
0 ms |
0 KB |
- |
