#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<pair<int, int> > vii;
typedef vector<vector<pair<int, int> > > vvii;
#define pb(x) push_back(x)
#define mp(x, y) make_pair(x, y)
ll N, Q, S, T;
ll A[200001];
ll res = 0;
typedef struct Node_ {
int llim, rlim;
ll update;
} Node;
const int segsz = 524288;
Node seg[segsz];
int offset = segsz/2;
ll get(int x) {
x += offset;
ll ret = 0;
while (x > 0) {
ret += seg[x].update;
x /= 2;
}
return ret;
}
void _update(int x, int l, int r, int dy) {
int llim = seg[x].llim;
int rlim = seg[x].rlim;
int mid = (llim + rlim) / 2;
if (l == llim && r == rlim) seg[x].update += dy;
else if (l > mid) _update(2*x+1, l, r, dy);
else if (r <= mid) _update(2*x, l, r, dy);
else {
_update(2*x, l, mid, dy);
_update(2*x+1, mid+1, r, dy);
}
}
void update(int l, int r, int dy) { _update(1, l, r, dy); }
int main(int argc, char **argv) {
//freopen("input", "r", stdin);
//freopen("output", "w", stdout);
//ios_base::sync_with_stdio(0);
//cin.tie(0);
//cin >> N >> Q >> S >> T;
scanf("%lld%lld%lld%lld", &N, &Q, &S, &T);
for (int i = offset; i < segsz; i++) {
seg[i].llim = seg[i].rlim = i - offset;
seg[i].update = 0;
}
for (int i = offset-1; i > 0; i--) {
seg[i].llim = seg[2*i].llim;
seg[i].rlim = seg[2*i+1].rlim;
seg[i].update = 0;
}
for (int i = 0; i < N+1; i++) {
//cin >> A[i];
scanf("%lld", &(A[i]));
seg[i+offset].update = A[i];
}
for (int i = 1; i < N+1; i++) {
if (A[i] == A[i-1]) continue;
if (A[i] > A[i-1]) res -= S*(A[i]-A[i-1]);
else res += T*(A[i-1]-A[i]);
}
for (int i = 0; i < Q; i++) {
int l, r, dy; //cin >> l >> r >> dy;
scanf("%d%d%d", &l, &r, &dy);
ll a = get(l-1), b = get(l), c = get(r); ll d = (r+1<=N?get(r+1):c);
ll old_effect = (a>b?T*(a-b):-S*(b-a)) + (c>d?T*(c-d):-S*(d-c));
update(l, r, dy);
b += dy; c += dy; if (r+1>N) d = c;
ll new_effect = (a>b?T*(a-b):-S*(b-a)) + (c>d?T*(c-d):-S*(d-c));
res += new_effect - old_effect;
//cout << res << "\n";
printf("%lld\n", res);
}
return 0;
}
Compilation message
foehn_phenomena.cpp: In function 'int main(int, char**)':
foehn_phenomena.cpp:56:43: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld%lld%lld%lld", &N, &Q, &S, &T);
^
foehn_phenomena.cpp:68:25: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%lld", &(A[i]));
^
foehn_phenomena.cpp:78:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &l, &r, &dy);
^
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
11772 KB |
Output is correct |
2 |
Correct |
3 ms |
11772 KB |
Output is correct |
3 |
Correct |
0 ms |
11772 KB |
Output is correct |
4 |
Correct |
6 ms |
11772 KB |
Output is correct |
5 |
Correct |
0 ms |
11772 KB |
Output is correct |
6 |
Correct |
0 ms |
11772 KB |
Output is correct |
7 |
Correct |
3 ms |
11772 KB |
Output is correct |
8 |
Correct |
3 ms |
11772 KB |
Output is correct |
9 |
Correct |
3 ms |
11772 KB |
Output is correct |
10 |
Correct |
3 ms |
11772 KB |
Output is correct |
11 |
Correct |
0 ms |
11772 KB |
Output is correct |
12 |
Correct |
3 ms |
11772 KB |
Output is correct |
13 |
Correct |
3 ms |
11772 KB |
Output is correct |
14 |
Correct |
0 ms |
11772 KB |
Output is correct |
15 |
Correct |
0 ms |
11772 KB |
Output is correct |
16 |
Correct |
6 ms |
11772 KB |
Output is correct |
17 |
Correct |
0 ms |
11772 KB |
Output is correct |
18 |
Correct |
3 ms |
11772 KB |
Output is correct |
19 |
Correct |
0 ms |
11772 KB |
Output is correct |
20 |
Correct |
0 ms |
11772 KB |
Output is correct |
21 |
Correct |
0 ms |
11772 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
316 ms |
11772 KB |
Output is correct |
2 |
Correct |
346 ms |
11772 KB |
Output is correct |
3 |
Correct |
359 ms |
11772 KB |
Output is correct |
4 |
Correct |
376 ms |
11772 KB |
Output is correct |
5 |
Correct |
356 ms |
11772 KB |
Output is correct |
6 |
Correct |
183 ms |
11772 KB |
Output is correct |
7 |
Correct |
203 ms |
11772 KB |
Output is correct |
8 |
Correct |
329 ms |
11772 KB |
Output is correct |
9 |
Correct |
339 ms |
11772 KB |
Output is correct |
10 |
Correct |
393 ms |
11772 KB |
Output is correct |
11 |
Correct |
153 ms |
11772 KB |
Output is correct |
12 |
Correct |
209 ms |
11772 KB |
Output is correct |
13 |
Correct |
229 ms |
11772 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
9 ms |
11772 KB |
Output is correct |
2 |
Correct |
3 ms |
11772 KB |
Output is correct |
3 |
Correct |
0 ms |
11772 KB |
Output is correct |
4 |
Correct |
6 ms |
11772 KB |
Output is correct |
5 |
Correct |
0 ms |
11772 KB |
Output is correct |
6 |
Correct |
0 ms |
11772 KB |
Output is correct |
7 |
Correct |
3 ms |
11772 KB |
Output is correct |
8 |
Correct |
3 ms |
11772 KB |
Output is correct |
9 |
Correct |
3 ms |
11772 KB |
Output is correct |
10 |
Correct |
3 ms |
11772 KB |
Output is correct |
11 |
Correct |
0 ms |
11772 KB |
Output is correct |
12 |
Correct |
3 ms |
11772 KB |
Output is correct |
13 |
Correct |
3 ms |
11772 KB |
Output is correct |
14 |
Correct |
0 ms |
11772 KB |
Output is correct |
15 |
Correct |
0 ms |
11772 KB |
Output is correct |
16 |
Correct |
6 ms |
11772 KB |
Output is correct |
17 |
Correct |
0 ms |
11772 KB |
Output is correct |
18 |
Correct |
3 ms |
11772 KB |
Output is correct |
19 |
Correct |
0 ms |
11772 KB |
Output is correct |
20 |
Correct |
0 ms |
11772 KB |
Output is correct |
21 |
Correct |
0 ms |
11772 KB |
Output is correct |
22 |
Correct |
316 ms |
11772 KB |
Output is correct |
23 |
Correct |
346 ms |
11772 KB |
Output is correct |
24 |
Correct |
359 ms |
11772 KB |
Output is correct |
25 |
Correct |
376 ms |
11772 KB |
Output is correct |
26 |
Correct |
356 ms |
11772 KB |
Output is correct |
27 |
Correct |
183 ms |
11772 KB |
Output is correct |
28 |
Correct |
203 ms |
11772 KB |
Output is correct |
29 |
Correct |
329 ms |
11772 KB |
Output is correct |
30 |
Correct |
339 ms |
11772 KB |
Output is correct |
31 |
Correct |
393 ms |
11772 KB |
Output is correct |
32 |
Correct |
153 ms |
11772 KB |
Output is correct |
33 |
Correct |
209 ms |
11772 KB |
Output is correct |
34 |
Correct |
229 ms |
11772 KB |
Output is correct |
35 |
Correct |
346 ms |
11772 KB |
Output is correct |
36 |
Correct |
373 ms |
11772 KB |
Output is correct |
37 |
Correct |
379 ms |
11772 KB |
Output is correct |
38 |
Correct |
369 ms |
11772 KB |
Output is correct |
39 |
Correct |
316 ms |
11772 KB |
Output is correct |
40 |
Correct |
399 ms |
11772 KB |
Output is correct |
41 |
Correct |
336 ms |
11772 KB |
Output is correct |
42 |
Correct |
343 ms |
11772 KB |
Output is correct |
43 |
Correct |
349 ms |
11772 KB |
Output is correct |
44 |
Correct |
326 ms |
11772 KB |
Output is correct |
45 |
Correct |
349 ms |
11772 KB |
Output is correct |
46 |
Correct |
373 ms |
11772 KB |
Output is correct |
47 |
Correct |
193 ms |
11772 KB |
Output is correct |
48 |
Correct |
159 ms |
11772 KB |
Output is correct |
49 |
Correct |
306 ms |
11772 KB |
Output is correct |
50 |
Correct |
196 ms |
11772 KB |
Output is correct |
51 |
Correct |
199 ms |
11772 KB |
Output is correct |
52 |
Correct |
219 ms |
11772 KB |
Output is correct |