oj.uz

Submission #996668

# Submission time Handle Problem Language Result Execution time Memory
996668 2024-06-11T04:39:09 Z overwatch9 Foehn Phenomena (JOI17_foehn_phenomena) C++17
30 / 100
 1000 ms 3420 KB 
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
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];
    while (Q--) {
        int l, r, x;
        cin >> l >> r >> x;
        for (int i = l; i <= r; i++)
            a[i] += x;
        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]);
        }
        cout << ans << '\n';
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 348 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 8 ms 504 KB Output is correct
4 Correct 8 ms 508 KB Output is correct
5 Correct 8 ms 348 KB Output is correct
6 Correct 8 ms 444 KB Output is correct
7 Correct 8 ms 512 KB Output is correct
8 Correct 12 ms 348 KB Output is correct
9 Correct 8 ms 448 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 8 ms 348 KB Output is correct
12 Correct 8 ms 348 KB Output is correct
13 Correct 8 ms 516 KB Output is correct
14 Correct 7 ms 504 KB Output is correct
15 Correct 7 ms 348 KB Output is correct
16 Correct 7 ms 664 KB Output is correct
17 Correct 8 ms 496 KB Output is correct
18 Correct 11 ms 348 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

Subtask #2
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1073 ms 3420 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 348 KB Output is correct
2 Correct 8 ms 344 KB Output is correct
3 Correct 8 ms 504 KB Output is correct
4 Correct 8 ms 508 KB Output is correct
5 Correct 8 ms 348 KB Output is correct
6 Correct 8 ms 444 KB Output is correct
7 Correct 8 ms 512 KB Output is correct
8 Correct 12 ms 348 KB Output is correct
9 Correct 8 ms 448 KB Output is correct
10 Correct 8 ms 344 KB Output is correct
11 Correct 8 ms 348 KB Output is correct
12 Correct 8 ms 348 KB Output is correct
13 Correct 8 ms 516 KB Output is correct
14 Correct 7 ms 504 KB Output is correct
15 Correct 7 ms 348 KB Output is correct
16 Correct 7 ms 664 KB Output is correct
17 Correct 8 ms 496 KB Output is correct
18 Correct 11 ms 348 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 Execution timed out 1073 ms 3420 KB Time limit exceeded
23 Halted 0 ms 0 KB -