oj.uz

Submission #46630

# Submission time Handle Problem Language Result Execution time Memory
46630 2018-04-22T12:13:56 Z qoo2p5 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 233 ms 169684 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int INF = (int) 1e9 + 1e6 + 123;
const ll LINF = (ll) 1e18 + 1e9 + 123;

#define rep(i, s, t) for (auto i = (s); i < (t); ++(i))
#define per(i, s, t) for (auto i = (s); i >= (t); --(i))
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define mp make_pair
#define pb push_back

bool mini(auto &x, const auto &y) {
    if (y < x) {
        x = y;
        return 1;
    }
    return 0;
}

bool maxi(auto &x, const auto &y) {
    if (y > x) {
        x = y;
        return 1;
    }
    return 0;
}

void run();

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    run();
    return 0;
}

const int N = (int) 2e5 + 123;

int n, q;
ll s, t;
ll a[N], b[N];

ll f(ll x) {
    if (x > 0) {
        return -x * s;
    } else {
        return -x * t;
    }
}

void run() {
    cin >> n >> q >> s >> t;
    rep(i, 0, n + 1) {
        cin >> a[i];
    }
    rep(i, 0, n) {
        b[i] = a[i + 1] - a[i];
    }
    ll ans = 0;
    rep(i, 0, n) {
        ans += f(b[i]);
    }
    while (q--) {
        int l, r;
        ll x;
        cin >> l >> r >> x;
        ans -= f(b[l - 1]);
        b[l - 1] += x;
        ans += f(b[l - 1]);
        if (r < n) {
            ans -= f(b[r]);
            b[r] -= x;
            ans += f(b[r]);
        }
        cout << ans << "\n";
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 5 ms 684 KB Output is correct
3 Correct 3 ms 848 KB Output is correct
4 Correct 3 ms 892 KB Output is correct
5 Correct 3 ms 940 KB Output is correct
6 Correct 3 ms 1120 KB Output is correct
7 Correct 3 ms 1120 KB Output is correct
8 Correct 3 ms 1136 KB Output is correct
9 Correct 3 ms 1184 KB Output is correct
10 Correct 3 ms 1184 KB Output is correct
11 Correct 4 ms 1280 KB Output is correct
12 Correct 3 ms 1452 KB Output is correct
13 Correct 4 ms 1496 KB Output is correct
14 Correct 3 ms 1608 KB Output is correct
15 Correct 4 ms 1608 KB Output is correct
16 Correct 4 ms 1608 KB Output is correct
17 Correct 3 ms 1608 KB Output is correct
18 Correct 3 ms 1676 KB Output is correct
19 Correct 2 ms 1676 KB Output is correct
20 Correct 2 ms 1676 KB Output is correct
21 Correct 2 ms 1772 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 233 ms 11540 KB Output is correct
2 Correct 141 ms 17612 KB Output is correct
3 Correct 152 ms 23692 KB Output is correct
4 Correct 180 ms 28412 KB Output is correct
5 Correct 178 ms 35192 KB Output is correct
6 Correct 131 ms 40236 KB Output is correct
7 Correct 118 ms 44980 KB Output is correct
8 Correct 140 ms 50328 KB Output is correct
9 Correct 170 ms 56240 KB Output is correct
10 Correct 158 ms 60596 KB Output is correct
11 Correct 109 ms 65916 KB Output is correct
12 Correct 120 ms 71196 KB Output is correct
13 Correct 116 ms 76204 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 504 KB Output is correct
2 Correct 5 ms 684 KB Output is correct
3 Correct 3 ms 848 KB Output is correct
4 Correct 3 ms 892 KB Output is correct
5 Correct 3 ms 940 KB Output is correct
6 Correct 3 ms 1120 KB Output is correct
7 Correct 3 ms 1120 KB Output is correct
8 Correct 3 ms 1136 KB Output is correct
9 Correct 3 ms 1184 KB Output is correct
10 Correct 3 ms 1184 KB Output is correct
11 Correct 4 ms 1280 KB Output is correct
12 Correct 3 ms 1452 KB Output is correct
13 Correct 4 ms 1496 KB Output is correct
14 Correct 3 ms 1608 KB Output is correct
15 Correct 4 ms 1608 KB Output is correct
16 Correct 4 ms 1608 KB Output is correct
17 Correct 3 ms 1608 KB Output is correct
18 Correct 3 ms 1676 KB Output is correct
19 Correct 2 ms 1676 KB Output is correct
20 Correct 2 ms 1676 KB Output is correct
21 Correct 2 ms 1772 KB Output is correct
22 Correct 233 ms 11540 KB Output is correct
23 Correct 141 ms 17612 KB Output is correct
24 Correct 152 ms 23692 KB Output is correct
25 Correct 180 ms 28412 KB Output is correct
26 Correct 178 ms 35192 KB Output is correct
27 Correct 131 ms 40236 KB Output is correct
28 Correct 118 ms 44980 KB Output is correct
29 Correct 140 ms 50328 KB Output is correct
30 Correct 170 ms 56240 KB Output is correct
31 Correct 158 ms 60596 KB Output is correct
32 Correct 109 ms 65916 KB Output is correct
33 Correct 120 ms 71196 KB Output is correct
34 Correct 116 ms 76204 KB Output is correct
35 Correct 141 ms 79480 KB Output is correct
36 Correct 153 ms 86312 KB Output is correct
37 Correct 155 ms 92500 KB Output is correct
38 Correct 155 ms 97764 KB Output is correct
39 Correct 156 ms 103212 KB Output is correct
40 Correct 163 ms 108636 KB Output is correct
41 Correct 172 ms 113928 KB Output is correct
42 Correct 177 ms 119352 KB Output is correct
43 Correct 142 ms 124132 KB Output is correct
44 Correct 169 ms 129920 KB Output is correct
45 Correct 140 ms 135328 KB Output is correct
46 Correct 155 ms 142012 KB Output is correct
47 Correct 115 ms 146712 KB Output is correct
48 Correct 124 ms 151564 KB Output is correct
49 Correct 127 ms 154892 KB Output is correct
50 Correct 115 ms 160244 KB Output is correct
51 Correct 113 ms 165060 KB Output is correct
52 Correct 114 ms 169684 KB Output is correct