oj.uz

Submission #94516

# Submission time Handle Problem Language Result Execution time Memory
94516 2019-01-19T17:47:19 Z fedoseevtimofey Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 129 ms 13304 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;

#define int long long

signed main() {
    ios_base::sync_with_stdio(false); cin.tie(0); cout.setf(ios::fixed); cout.precision(20);
    #ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
    #endif
    int n, q, s, t;
    cin >> n >> q >> s >> t;
    vector <int> a(n + 1);
    for (int i = 0; i < n + 1; ++i) {
        cin >> a[i];
    }
    vector <int> diff(n + 1);
    for (int i = 1; i <= n; ++i) diff[i] = a[i] - a[i - 1];
    ll ans = 0;
    for (int i = 1; i <= n; ++i) {
        if (diff[i] > 0) ans -= (ll)(diff[i]) * s;
        else ans += (ll)(-diff[i]) * t;
    }
    for (int i = 0; i < q; ++i) {
        int l, r, x;
        cin >> l >> r >> x;
        if (diff[l] > 0) {
            ans += (ll)diff[l] * s;
        }
        else {
            ans -= (ll)-diff[l] * t;
        }
        diff[l] += x;
        if (diff[l] > 0) {
            ans -= (ll)diff[l] * s;
        }
        else {
            ans += (ll)-diff[l] * t;
        }

        if (r + 1 <= n) {
            if (diff[r + 1] > 0) {
                ans += (ll)diff[r + 1] * s;
            }
            else {
                ans -= (ll)-diff[r + 1] * t;
            }
            diff[r + 1] -= x;
            if (diff[r + 1] > 0) {
                ans -= (ll)diff[r + 1] * s;
            }
            else {
                ans += (ll)-diff[r + 1] * t;
            }
        }
        cout << ans << '\n';
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 380 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 115 ms 4856 KB Output is correct
2 Correct 122 ms 5492 KB Output is correct
3 Correct 120 ms 6108 KB Output is correct
4 Correct 111 ms 5240 KB Output is correct
5 Correct 109 ms 6076 KB Output is correct
6 Correct 92 ms 6392 KB Output is correct
7 Correct 97 ms 6388 KB Output is correct
8 Correct 118 ms 6348 KB Output is correct
9 Correct 120 ms 6728 KB Output is correct
10 Correct 124 ms 5596 KB Output is correct
11 Correct 88 ms 6392 KB Output is correct
12 Correct 92 ms 6892 KB Output is correct
13 Correct 92 ms 11896 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
2 Correct 3 ms 376 KB Output is correct
3 Correct 3 ms 376 KB Output is correct
4 Correct 3 ms 376 KB Output is correct
5 Correct 3 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 376 KB Output is correct
8 Correct 3 ms 376 KB Output is correct
9 Correct 3 ms 376 KB Output is correct
10 Correct 3 ms 376 KB Output is correct
11 Correct 3 ms 376 KB Output is correct
12 Correct 3 ms 376 KB Output is correct
13 Correct 3 ms 376 KB Output is correct
14 Correct 3 ms 376 KB Output is correct
15 Correct 3 ms 376 KB Output is correct
16 Correct 3 ms 376 KB Output is correct
17 Correct 3 ms 380 KB Output is correct
18 Correct 3 ms 376 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 380 KB Output is correct
22 Correct 115 ms 4856 KB Output is correct
23 Correct 122 ms 5492 KB Output is correct
24 Correct 120 ms 6108 KB Output is correct
25 Correct 111 ms 5240 KB Output is correct
26 Correct 109 ms 6076 KB Output is correct
27 Correct 92 ms 6392 KB Output is correct
28 Correct 97 ms 6388 KB Output is correct
29 Correct 118 ms 6348 KB Output is correct
30 Correct 120 ms 6728 KB Output is correct
31 Correct 124 ms 5596 KB Output is correct
32 Correct 88 ms 6392 KB Output is correct
33 Correct 92 ms 6892 KB Output is correct
34 Correct 92 ms 11896 KB Output is correct
35 Correct 113 ms 10444 KB Output is correct
36 Correct 129 ms 11768 KB Output is correct
37 Correct 115 ms 12712 KB Output is correct
38 Correct 123 ms 12440 KB Output is correct
39 Correct 127 ms 12408 KB Output is correct
40 Correct 120 ms 12440 KB Output is correct
41 Correct 122 ms 12280 KB Output is correct
42 Correct 120 ms 12280 KB Output is correct
43 Correct 122 ms 11748 KB Output is correct
44 Correct 125 ms 12024 KB Output is correct
45 Correct 117 ms 12024 KB Output is correct
46 Correct 124 ms 13304 KB Output is correct
47 Correct 96 ms 11768 KB Output is correct
48 Correct 96 ms 11628 KB Output is correct
49 Correct 110 ms 10744 KB Output is correct
50 Correct 90 ms 11516 KB Output is correct
51 Correct 92 ms 11772 KB Output is correct
52 Correct 92 ms 11640 KB Output is correct