#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll arr[200001];
ll ans[200001];
ll diff[200001];
int main(){
ll n,q,s,t;
cin >> n >> q >> s >> t;
n++;
for(int i=0; i<n; i++){
cin >> arr[i];
}
while(q--){
ll l,r,c;
cin >> l >> r >> c;
for(ll i=l; i<=r; i++){
arr[i]+=c;
}
ll cur = 0;
for(ll i=1; i<n; i++){
ll diff = abs(arr[i]-arr[i-1]);
if(arr[i]>arr[i-1]){
cur -= (diff*s);
}
else{
cur += (diff*t);
}
}
cout << cur << endl;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
332 KB |
Output is correct |
2 |
Correct |
15 ms |
344 KB |
Output is correct |
3 |
Correct |
16 ms |
356 KB |
Output is correct |
4 |
Correct |
15 ms |
352 KB |
Output is correct |
5 |
Correct |
15 ms |
332 KB |
Output is correct |
6 |
Correct |
16 ms |
332 KB |
Output is correct |
7 |
Correct |
18 ms |
340 KB |
Output is correct |
8 |
Correct |
17 ms |
332 KB |
Output is correct |
9 |
Correct |
15 ms |
332 KB |
Output is correct |
10 |
Correct |
15 ms |
332 KB |
Output is correct |
11 |
Correct |
15 ms |
352 KB |
Output is correct |
12 |
Correct |
15 ms |
344 KB |
Output is correct |
13 |
Correct |
18 ms |
348 KB |
Output is correct |
14 |
Correct |
13 ms |
348 KB |
Output is correct |
15 |
Correct |
15 ms |
348 KB |
Output is correct |
16 |
Correct |
13 ms |
348 KB |
Output is correct |
17 |
Correct |
15 ms |
332 KB |
Output is correct |
18 |
Correct |
16 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
204 KB |
Output is correct |
20 |
Correct |
1 ms |
204 KB |
Output is correct |
21 |
Correct |
1 ms |
204 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Execution timed out |
1093 ms |
1788 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
15 ms |
332 KB |
Output is correct |
2 |
Correct |
15 ms |
344 KB |
Output is correct |
3 |
Correct |
16 ms |
356 KB |
Output is correct |
4 |
Correct |
15 ms |
352 KB |
Output is correct |
5 |
Correct |
15 ms |
332 KB |
Output is correct |
6 |
Correct |
16 ms |
332 KB |
Output is correct |
7 |
Correct |
18 ms |
340 KB |
Output is correct |
8 |
Correct |
17 ms |
332 KB |
Output is correct |
9 |
Correct |
15 ms |
332 KB |
Output is correct |
10 |
Correct |
15 ms |
332 KB |
Output is correct |
11 |
Correct |
15 ms |
352 KB |
Output is correct |
12 |
Correct |
15 ms |
344 KB |
Output is correct |
13 |
Correct |
18 ms |
348 KB |
Output is correct |
14 |
Correct |
13 ms |
348 KB |
Output is correct |
15 |
Correct |
15 ms |
348 KB |
Output is correct |
16 |
Correct |
13 ms |
348 KB |
Output is correct |
17 |
Correct |
15 ms |
332 KB |
Output is correct |
18 |
Correct |
16 ms |
340 KB |
Output is correct |
19 |
Correct |
1 ms |
204 KB |
Output is correct |
20 |
Correct |
1 ms |
204 KB |
Output is correct |
21 |
Correct |
1 ms |
204 KB |
Output is correct |
22 |
Execution timed out |
1093 ms |
1788 KB |
Time limit exceeded |
23 |
Halted |
0 ms |
0 KB |
- |