#include <bits/stdc++.h>
using namespace std;
#define ll long long
int main() {
int n, q, s, t;
cin >> n >> q >> s >> t;
vector<ll> a(n+1);
for (int i = 0; i <= n; i++) {
cin >> a[i];
}
vector<ll> temp(n+1);
while (q--) {
int l, r, x;
cin >> l >> r >> x;
for (int i = l; i <= r; i++) {
a[i] += x;
}
for (int i = 0; i < n; i++) {
if (a[i] < a[i+1]) {
temp[i+1] = temp[i]-(a[i+1]-a[i])*s;
}
else {
temp[i+1] = temp[i]+(a[i]-a[i+1])*t;
}
}
cout << temp[n] << '\n';
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
348 KB |
Output is correct |
2 |
Correct |
8 ms |
488 KB |
Output is correct |
3 |
Correct |
8 ms |
444 KB |
Output is correct |
4 |
Correct |
8 ms |
496 KB |
Output is correct |
5 |
Correct |
8 ms |
348 KB |
Output is correct |
6 |
Correct |
8 ms |
348 KB |
Output is correct |
7 |
Correct |
8 ms |
348 KB |
Output is correct |
8 |
Correct |
8 ms |
348 KB |
Output is correct |
9 |
Correct |
8 ms |
536 KB |
Output is correct |
10 |
Correct |
10 ms |
348 KB |
Output is correct |
11 |
Correct |
8 ms |
348 KB |
Output is correct |
12 |
Correct |
8 ms |
348 KB |
Output is correct |
13 |
Correct |
9 ms |
348 KB |
Output is correct |
14 |
Correct |
7 ms |
348 KB |
Output is correct |
15 |
Correct |
10 ms |
348 KB |
Output is correct |
16 |
Correct |
7 ms |
532 KB |
Output is correct |
17 |
Correct |
9 ms |
348 KB |
Output is correct |
18 |
Correct |
8 ms |
516 KB |
Output is correct |
19 |
Correct |
0 ms |
348 KB |
Output is correct |
20 |
Correct |
1 ms |
348 KB |
Output is correct |
21 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
1071 ms |
3556 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
8 ms |
348 KB |
Output is correct |
2 |
Correct |
8 ms |
488 KB |
Output is correct |
3 |
Correct |
8 ms |
444 KB |
Output is correct |
4 |
Correct |
8 ms |
496 KB |
Output is correct |
5 |
Correct |
8 ms |
348 KB |
Output is correct |
6 |
Correct |
8 ms |
348 KB |
Output is correct |
7 |
Correct |
8 ms |
348 KB |
Output is correct |
8 |
Correct |
8 ms |
348 KB |
Output is correct |
9 |
Correct |
8 ms |
536 KB |
Output is correct |
10 |
Correct |
10 ms |
348 KB |
Output is correct |
11 |
Correct |
8 ms |
348 KB |
Output is correct |
12 |
Correct |
8 ms |
348 KB |
Output is correct |
13 |
Correct |
9 ms |
348 KB |
Output is correct |
14 |
Correct |
7 ms |
348 KB |
Output is correct |
15 |
Correct |
10 ms |
348 KB |
Output is correct |
16 |
Correct |
7 ms |
532 KB |
Output is correct |
17 |
Correct |
9 ms |
348 KB |
Output is correct |
18 |
Correct |
8 ms |
516 KB |
Output is correct |
19 |
Correct |
0 ms |
348 KB |
Output is correct |
20 |
Correct |
1 ms |
348 KB |
Output is correct |
21 |
Correct |
0 ms |
348 KB |
Output is correct |
22 |
Execution timed out |
1071 ms |
3556 KB |
Time limit exceeded |
23 |
Halted |
0 ms |
0 KB |
- |