#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
struct node {
ll val = 0;
bool pd = false;
ll lz = 0;
};
struct stree {
#define lc v*2
#define rc v*2+1
vector <node> tree;
stree (int s) {
tree.resize(s * 4);
}
void pushdown(int v) {
if (!tree[v].pd)
return;
tree[v].pd = false;
tree[lc].pd = tree[rc].pd = true;
tree[lc].lz += tree[v].lz;
tree[rc].lz += tree[v].lz;
tree[v].lz = 0;
}
void update(int v, int tl, int tr, int l, int r, ll delta) {
if (tl > r || tr < l)
return;
if (tl >= l && tr <= r) {
tree[v].lz += delta;
tree[v].pd = true;
return;
}
pushdown(v);
int tm = (tl + tr) / 2;
update(lc, tl, tm, l, r, delta);
update(rc, tm+1, tr, l, r, delta);
}
int query(int v, int tl, int tr, int p) {
if (tl == tr)
return tree[v].lz + tree[v].val;
pushdown(v);
int tm = (tl + tr) / 2;
if (tm >= p && tl <= p)
return query(lc, tl, tm, p);
else
return query(rc, tm+1, tr, p);
}
};
int main() {
int N, Q;
ll S, T;
cin >> N >> Q >> S >> T;
vector <ll> a(N+1);
for (int i = 0; i <= N; i++)
cin >> a[i];
stree tree(N+2);
int sz = N+1;
for (int i = 0; i <= N; i++)
tree.update(1, 0, sz, i, i, a[i]);
ll ans = 0;
for (int i = 0; i+1 <= N; i++) {
if (a[i] < a[i+1])
ans -= S * (a[i+1] - a[i]);
else
ans += T * (a[i] - a[i+1]);
}
while (Q--) {
int l, r, x;
cin >> l >> r >> x;
ll a = tree.query(1, 0, sz, l-1);
ll b = tree.query(1, 0, sz, l);
ll c = tree.query(1, 0, sz, r);
ll d = tree.query(1, 0, sz, r+1);
if (a < b)
ans += S * (b - a);
else
ans -= T * (a - b);
if (r+1 <= N) {
if (c < d)
ans += S * (d - c);
else
ans -= T * (c - d);
}
b += x;
c += x;
if (a < b)
ans -= S * (b - a);
else
ans += T * (a - b);
if (r+1 <= N) {
if (c < d)
ans -= S * (d - c);
else
ans += T * (c - d);
}
tree.update(1, 0, sz, l, r, x);
cout << ans << '\n';
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
600 KB |
Output is correct |
2 |
Correct |
5 ms |
600 KB |
Output is correct |
3 |
Correct |
5 ms |
604 KB |
Output is correct |
4 |
Correct |
5 ms |
604 KB |
Output is correct |
5 |
Correct |
5 ms |
764 KB |
Output is correct |
6 |
Correct |
7 ms |
704 KB |
Output is correct |
7 |
Correct |
5 ms |
712 KB |
Output is correct |
8 |
Correct |
5 ms |
500 KB |
Output is correct |
9 |
Correct |
5 ms |
604 KB |
Output is correct |
10 |
Correct |
5 ms |
604 KB |
Output is correct |
11 |
Correct |
5 ms |
604 KB |
Output is correct |
12 |
Correct |
5 ms |
604 KB |
Output is correct |
13 |
Correct |
4 ms |
604 KB |
Output is correct |
14 |
Correct |
5 ms |
600 KB |
Output is correct |
15 |
Correct |
5 ms |
712 KB |
Output is correct |
16 |
Correct |
4 ms |
604 KB |
Output is correct |
17 |
Correct |
6 ms |
604 KB |
Output is correct |
18 |
Correct |
4 ms |
604 KB |
Output is correct |
19 |
Correct |
0 ms |
348 KB |
Output is correct |
20 |
Correct |
0 ms |
348 KB |
Output is correct |
21 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
557 ms |
26840 KB |
Output is correct |
2 |
Correct |
557 ms |
28056 KB |
Output is correct |
3 |
Correct |
575 ms |
28752 KB |
Output is correct |
4 |
Correct |
586 ms |
28020 KB |
Output is correct |
5 |
Correct |
581 ms |
29380 KB |
Output is correct |
6 |
Correct |
438 ms |
28312 KB |
Output is correct |
7 |
Correct |
441 ms |
28240 KB |
Output is correct |
8 |
Correct |
538 ms |
29008 KB |
Output is correct |
9 |
Correct |
605 ms |
29524 KB |
Output is correct |
10 |
Correct |
608 ms |
28176 KB |
Output is correct |
11 |
Correct |
429 ms |
28244 KB |
Output is correct |
12 |
Correct |
453 ms |
29236 KB |
Output is correct |
13 |
Correct |
440 ms |
29268 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
5 ms |
600 KB |
Output is correct |
2 |
Correct |
5 ms |
600 KB |
Output is correct |
3 |
Correct |
5 ms |
604 KB |
Output is correct |
4 |
Correct |
5 ms |
604 KB |
Output is correct |
5 |
Correct |
5 ms |
764 KB |
Output is correct |
6 |
Correct |
7 ms |
704 KB |
Output is correct |
7 |
Correct |
5 ms |
712 KB |
Output is correct |
8 |
Correct |
5 ms |
500 KB |
Output is correct |
9 |
Correct |
5 ms |
604 KB |
Output is correct |
10 |
Correct |
5 ms |
604 KB |
Output is correct |
11 |
Correct |
5 ms |
604 KB |
Output is correct |
12 |
Correct |
5 ms |
604 KB |
Output is correct |
13 |
Correct |
4 ms |
604 KB |
Output is correct |
14 |
Correct |
5 ms |
600 KB |
Output is correct |
15 |
Correct |
5 ms |
712 KB |
Output is correct |
16 |
Correct |
4 ms |
604 KB |
Output is correct |
17 |
Correct |
6 ms |
604 KB |
Output is correct |
18 |
Correct |
4 ms |
604 KB |
Output is correct |
19 |
Correct |
0 ms |
348 KB |
Output is correct |
20 |
Correct |
0 ms |
348 KB |
Output is correct |
21 |
Correct |
0 ms |
348 KB |
Output is correct |
22 |
Correct |
557 ms |
26840 KB |
Output is correct |
23 |
Correct |
557 ms |
28056 KB |
Output is correct |
24 |
Correct |
575 ms |
28752 KB |
Output is correct |
25 |
Correct |
586 ms |
28020 KB |
Output is correct |
26 |
Correct |
581 ms |
29380 KB |
Output is correct |
27 |
Correct |
438 ms |
28312 KB |
Output is correct |
28 |
Correct |
441 ms |
28240 KB |
Output is correct |
29 |
Correct |
538 ms |
29008 KB |
Output is correct |
30 |
Correct |
605 ms |
29524 KB |
Output is correct |
31 |
Correct |
608 ms |
28176 KB |
Output is correct |
32 |
Correct |
429 ms |
28244 KB |
Output is correct |
33 |
Correct |
453 ms |
29236 KB |
Output is correct |
34 |
Correct |
440 ms |
29268 KB |
Output is correct |
35 |
Correct |
577 ms |
27552 KB |
Output is correct |
36 |
Correct |
548 ms |
29012 KB |
Output is correct |
37 |
Correct |
595 ms |
29776 KB |
Output is correct |
38 |
Correct |
621 ms |
29764 KB |
Output is correct |
39 |
Correct |
568 ms |
29780 KB |
Output is correct |
40 |
Correct |
566 ms |
29776 KB |
Output is correct |
41 |
Correct |
570 ms |
29504 KB |
Output is correct |
42 |
Correct |
560 ms |
29524 KB |
Output is correct |
43 |
Correct |
561 ms |
28768 KB |
Output is correct |
44 |
Correct |
568 ms |
29364 KB |
Output is correct |
45 |
Correct |
598 ms |
29520 KB |
Output is correct |
46 |
Incorrect |
589 ms |
30336 KB |
Output isn't correct |
47 |
Halted |
0 ms |
0 KB |
- |