oj.uz

Submission #113111

# Submission time Handle Problem Language Result Execution time Memory
113111 2019-05-23T18:48:01 Z dolphingarlic Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 125 ms 11512 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#define FOR(i, x, y) for (ll i = x; i < y; i++)
typedef long long ll;
using namespace std;

ll diffs[200001];
ll n, q, s, t, wind = 0;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> q >> s >> t;
    ll curr;
    cin >> curr;
    FOR(i, 1, n + 1) {
        ll x;
        cin >> x;
        diffs[i] = x - curr;
        curr = x;
    }
    FOR(i, 1, n + 1) {
        if (diffs[i] > 0)
            wind -= diffs[i] * s;
        else
            wind -= diffs[i] * t;
    }

    FOR(i, 0, q) {
        ll a, b, x;
        cin >> a >> b >> x;
        if (diffs[a] > 0)
            wind += diffs[a] * s;
        else
            wind += diffs[a] * t;
        if (b != n) {
            if (diffs[b + 1] > 0)
                wind += diffs[b + 1] * s;
            else
                wind += diffs[b + 1] * t;
        }

        diffs[a] += x;
        diffs[b + 1] -= x;

        if (diffs[a] > 0)
            wind -= diffs[a] * s;
        else
            wind -= diffs[a] * t;
        if (b != n) {
            if (diffs[b + 1] > 0)
                wind -= diffs[b + 1] * s;
            else
                wind -= diffs[b + 1] * t;
        }

        cout << wind << '\n';
    }
    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 112 ms 8808 KB Output is correct
2 Correct 116 ms 9516 KB Output is correct
3 Correct 122 ms 9848 KB Output is correct
4 Correct 105 ms 9336 KB Output is correct
5 Correct 121 ms 10512 KB Output is correct
6 Correct 88 ms 9464 KB Output is correct
7 Correct 91 ms 9492 KB Output is correct
8 Correct 119 ms 10232 KB Output is correct
9 Correct 115 ms 10744 KB Output is correct
10 Correct 110 ms 9336 KB Output is correct
11 Correct 87 ms 9308 KB Output is correct
12 Correct 91 ms 10108 KB Output is correct
13 Correct 89 ms 10360 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 512 KB Output is correct
2 Correct 3 ms 512 KB Output is correct
3 Correct 3 ms 384 KB Output is correct
4 Correct 6 ms 512 KB Output is correct
5 Correct 3 ms 512 KB Output is correct
6 Correct 3 ms 384 KB Output is correct
7 Correct 3 ms 512 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 4 ms 512 KB Output is correct
11 Correct 3 ms 512 KB Output is correct
12 Correct 3 ms 512 KB Output is correct
13 Correct 3 ms 512 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 3 ms 512 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 3 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 2 ms 384 KB Output is correct
20 Correct 2 ms 384 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 112 ms 8808 KB Output is correct
23 Correct 116 ms 9516 KB Output is correct
24 Correct 122 ms 9848 KB Output is correct
25 Correct 105 ms 9336 KB Output is correct
26 Correct 121 ms 10512 KB Output is correct
27 Correct 88 ms 9464 KB Output is correct
28 Correct 91 ms 9492 KB Output is correct
29 Correct 119 ms 10232 KB Output is correct
30 Correct 115 ms 10744 KB Output is correct
31 Correct 110 ms 9336 KB Output is correct
32 Correct 87 ms 9308 KB Output is correct
33 Correct 91 ms 10108 KB Output is correct
34 Correct 89 ms 10360 KB Output is correct
35 Correct 110 ms 8924 KB Output is correct
36 Correct 125 ms 10232 KB Output is correct
37 Correct 124 ms 11052 KB Output is correct
38 Correct 124 ms 10872 KB Output is correct
39 Correct 125 ms 10868 KB Output is correct
40 Correct 125 ms 10872 KB Output is correct
41 Correct 120 ms 10832 KB Output is correct
42 Correct 122 ms 10824 KB Output is correct
43 Correct 120 ms 10120 KB Output is correct
44 Correct 120 ms 10616 KB Output is correct
45 Correct 108 ms 10488 KB Output is correct
46 Correct 113 ms 11512 KB Output is correct
47 Correct 93 ms 10104 KB Output is correct
48 Correct 94 ms 10104 KB Output is correct
49 Correct 98 ms 9264 KB Output is correct
50 Correct 89 ms 9976 KB Output is correct
51 Correct 91 ms 10388 KB Output is correct
52 Correct 89 ms 10124 KB Output is correct