#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define ll long long
const int MAX=2e5+10, SS=1<<18;
ll n, q, S, T, d[2*SS+10];
void Insert(int a, int b, int w){
a+=SS-1, b+=SS+1;
while(a+1<b){
if(a%2==0) d[a+1]+=w;
if(b%2==1) d[b-1]+=w;
a/=2, b/=2;
}
}
ll Query(int a){
a+=SS;
ll wyn=0;
while(a){
wyn+=d[a];
a/=2;
}
return wyn;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0), cout.tie(0);
cin>>n>>q>>S>>T;
ll last=0, akt=0;
for(int i=1; i<=n+1; i++){
int curr;
cin>>curr;
Insert(i-1, i-1, curr);
if(i>1){
if(curr>last) akt-=(curr-last)*S;
else akt+=(last-curr)*T;
}
last=curr;
}
for(int i=1; i<=q; i++){
ll l, r, x;
cin>>l>>r>>x;
ll popLewy=Query(l-1), lewy=Query(l), prawy=Query(r), nastPrawy=Query(r+1);
if(lewy>popLewy) akt+=(lewy-popLewy)*S;
else akt-=(popLewy-lewy)*T;
if(r<n){
if(nastPrawy>prawy) akt+=(nastPrawy-prawy)*S;
else akt-=(prawy-nastPrawy)*T;
}
Insert(l, r, x);
popLewy=Query(l-1), lewy=Query(l), prawy=Query(r), nastPrawy=Query(r+1);
if(lewy>popLewy) akt-=(lewy-popLewy)*S;
else akt+=(popLewy-lewy)*T;
if(r<n){
if(nastPrawy>prawy) akt-=(nastPrawy-prawy)*S;
else akt+=(prawy-nastPrawy)*T;
}
cout<<akt<<"\n";
}
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
344 KB |
Output is correct |
2 |
Correct |
2 ms |
468 KB |
Output is correct |
3 |
Correct |
2 ms |
468 KB |
Output is correct |
4 |
Correct |
2 ms |
468 KB |
Output is correct |
5 |
Correct |
2 ms |
468 KB |
Output is correct |
6 |
Correct |
2 ms |
468 KB |
Output is correct |
7 |
Correct |
2 ms |
468 KB |
Output is correct |
8 |
Correct |
2 ms |
468 KB |
Output is correct |
9 |
Correct |
2 ms |
468 KB |
Output is correct |
10 |
Correct |
2 ms |
468 KB |
Output is correct |
11 |
Correct |
3 ms |
468 KB |
Output is correct |
12 |
Correct |
2 ms |
468 KB |
Output is correct |
13 |
Correct |
2 ms |
388 KB |
Output is correct |
14 |
Correct |
2 ms |
340 KB |
Output is correct |
15 |
Correct |
2 ms |
468 KB |
Output is correct |
16 |
Correct |
2 ms |
340 KB |
Output is correct |
17 |
Correct |
2 ms |
468 KB |
Output is correct |
18 |
Correct |
2 ms |
464 KB |
Output is correct |
19 |
Correct |
1 ms |
328 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
340 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
166 ms |
7628 KB |
Output is correct |
2 |
Correct |
182 ms |
8292 KB |
Output is correct |
3 |
Correct |
196 ms |
8908 KB |
Output is correct |
4 |
Correct |
181 ms |
7960 KB |
Output is correct |
5 |
Correct |
169 ms |
8836 KB |
Output is correct |
6 |
Correct |
173 ms |
7680 KB |
Output is correct |
7 |
Correct |
130 ms |
7756 KB |
Output is correct |
8 |
Correct |
185 ms |
9096 KB |
Output is correct |
9 |
Correct |
166 ms |
9544 KB |
Output is correct |
10 |
Correct |
172 ms |
8148 KB |
Output is correct |
11 |
Correct |
139 ms |
7696 KB |
Output is correct |
12 |
Correct |
134 ms |
8076 KB |
Output is correct |
13 |
Correct |
143 ms |
10268 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
2 ms |
344 KB |
Output is correct |
2 |
Correct |
2 ms |
468 KB |
Output is correct |
3 |
Correct |
2 ms |
468 KB |
Output is correct |
4 |
Correct |
2 ms |
468 KB |
Output is correct |
5 |
Correct |
2 ms |
468 KB |
Output is correct |
6 |
Correct |
2 ms |
468 KB |
Output is correct |
7 |
Correct |
2 ms |
468 KB |
Output is correct |
8 |
Correct |
2 ms |
468 KB |
Output is correct |
9 |
Correct |
2 ms |
468 KB |
Output is correct |
10 |
Correct |
2 ms |
468 KB |
Output is correct |
11 |
Correct |
3 ms |
468 KB |
Output is correct |
12 |
Correct |
2 ms |
468 KB |
Output is correct |
13 |
Correct |
2 ms |
388 KB |
Output is correct |
14 |
Correct |
2 ms |
340 KB |
Output is correct |
15 |
Correct |
2 ms |
468 KB |
Output is correct |
16 |
Correct |
2 ms |
340 KB |
Output is correct |
17 |
Correct |
2 ms |
468 KB |
Output is correct |
18 |
Correct |
2 ms |
464 KB |
Output is correct |
19 |
Correct |
1 ms |
328 KB |
Output is correct |
20 |
Correct |
1 ms |
340 KB |
Output is correct |
21 |
Correct |
1 ms |
340 KB |
Output is correct |
22 |
Correct |
166 ms |
7628 KB |
Output is correct |
23 |
Correct |
182 ms |
8292 KB |
Output is correct |
24 |
Correct |
196 ms |
8908 KB |
Output is correct |
25 |
Correct |
181 ms |
7960 KB |
Output is correct |
26 |
Correct |
169 ms |
8836 KB |
Output is correct |
27 |
Correct |
173 ms |
7680 KB |
Output is correct |
28 |
Correct |
130 ms |
7756 KB |
Output is correct |
29 |
Correct |
185 ms |
9096 KB |
Output is correct |
30 |
Correct |
166 ms |
9544 KB |
Output is correct |
31 |
Correct |
172 ms |
8148 KB |
Output is correct |
32 |
Correct |
139 ms |
7696 KB |
Output is correct |
33 |
Correct |
134 ms |
8076 KB |
Output is correct |
34 |
Correct |
143 ms |
10268 KB |
Output is correct |
35 |
Correct |
164 ms |
10396 KB |
Output is correct |
36 |
Correct |
212 ms |
11908 KB |
Output is correct |
37 |
Correct |
193 ms |
12624 KB |
Output is correct |
38 |
Correct |
193 ms |
12368 KB |
Output is correct |
39 |
Correct |
193 ms |
12440 KB |
Output is correct |
40 |
Correct |
215 ms |
12364 KB |
Output is correct |
41 |
Correct |
180 ms |
12300 KB |
Output is correct |
42 |
Correct |
210 ms |
12420 KB |
Output is correct |
43 |
Correct |
178 ms |
11628 KB |
Output is correct |
44 |
Correct |
195 ms |
12056 KB |
Output is correct |
45 |
Correct |
171 ms |
12288 KB |
Output is correct |
46 |
Correct |
188 ms |
13176 KB |
Output is correct |
47 |
Correct |
131 ms |
10132 KB |
Output is correct |
48 |
Correct |
131 ms |
10040 KB |
Output is correct |
49 |
Correct |
154 ms |
10700 KB |
Output is correct |
50 |
Correct |
119 ms |
9944 KB |
Output is correct |
51 |
Correct |
165 ms |
10340 KB |
Output is correct |
52 |
Correct |
138 ms |
10108 KB |
Output is correct |