oj.uz

Submission #635888

# Submission time Handle Problem Language Result Execution time Memory
635888 2022-08-27T09:45:10 Z ljuba Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 167 ms 13140 KB 
#include <bits/stdc++.h>

using namespace std;

using ll = long long;

class FenwickTree {
private:
    int n;
    vector<ll> ft;
public:
    FenwickTree(int _n) : n(_n) {
        ft.resize(n + 1);
    }

    void update(int i, ll x) {
        for(; i <= n; i += i & -i) {
            ft[i] += x;
        }
    }

    ll query(int i) {
        ll r = 0;

        for(; i; i -= i & -i) {
            r += ft[i];
        }

        return r;
    }
};

ll s, t;

inline ll dodaj(ll x, ll y) {
    ll raz = abs(x - y);

    if(x < y) return -raz * s;
    else return raz * t;
}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n, q;

    cin >> n >> q >> s >> t;

    vector<ll> v(n + 1);

    for(int i = 0; i <= n; ++i) {
        cin >> v[i];
    }

    ll ans = 0;

    FenwickTree ft(n);

    for(int i = 1; i <= n; ++i) {
        ans += dodaj(v[i - 1], v[i]);

        ft.update(i, v[i]);

        if(i + 1 <= n) {
            ft.update(i + 1, -v[i]);
        }
    }

    while (q--) {
        int l, r;
        ll x;

        cin >> l >> r >> x;

        ans -= dodaj(ft.query(l - 1), ft.query(l));

        if(r + 1 <= n) {
            ans -= dodaj(ft.query(r), ft.query(r + 1));
        }

        ft.update(l, x);
        ft.update(r + 1, -x);

        ans += dodaj(ft.query(l - 1), ft.query(l));

        if(r + 1 <= n) {
            ans += dodaj(ft.query(r), ft.query(r + 1));
        }

        cout << ans << '\n';

        // for(int i = 1; i <= n; ++i) {
        //     cerr << ft.query(i) << " ";
        // }

        // cerr << endl;
    }
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 130 ms 10184 KB Output is correct
2 Correct 157 ms 10896 KB Output is correct
3 Correct 129 ms 11464 KB Output is correct
4 Correct 129 ms 10864 KB Output is correct
5 Correct 142 ms 11944 KB Output is correct
6 Correct 89 ms 10980 KB Output is correct
7 Correct 94 ms 11028 KB Output is correct
8 Correct 128 ms 11792 KB Output is correct
9 Correct 126 ms 12192 KB Output is correct
10 Correct 122 ms 10832 KB Output is correct
11 Correct 105 ms 10928 KB Output is correct
12 Correct 113 ms 11608 KB Output is correct
13 Correct 90 ms 11992 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 340 KB Output is correct
2 Correct 2 ms 340 KB Output is correct
3 Correct 2 ms 464 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 2 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 2 ms 340 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 1 ms 384 KB Output is correct
11 Correct 2 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 1 ms 368 KB Output is correct
17 Correct 1 ms 332 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 320 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 130 ms 10184 KB Output is correct
23 Correct 157 ms 10896 KB Output is correct
24 Correct 129 ms 11464 KB Output is correct
25 Correct 129 ms 10864 KB Output is correct
26 Correct 142 ms 11944 KB Output is correct
27 Correct 89 ms 10980 KB Output is correct
28 Correct 94 ms 11028 KB Output is correct
29 Correct 128 ms 11792 KB Output is correct
30 Correct 126 ms 12192 KB Output is correct
31 Correct 122 ms 10832 KB Output is correct
32 Correct 105 ms 10928 KB Output is correct
33 Correct 113 ms 11608 KB Output is correct
34 Correct 90 ms 11992 KB Output is correct
35 Correct 132 ms 10440 KB Output is correct
36 Correct 167 ms 11848 KB Output is correct
37 Correct 132 ms 12584 KB Output is correct
38 Correct 133 ms 12492 KB Output is correct
39 Correct 135 ms 12356 KB Output is correct
40 Correct 137 ms 12460 KB Output is correct
41 Correct 136 ms 12276 KB Output is correct
42 Correct 131 ms 12352 KB Output is correct
43 Correct 141 ms 11592 KB Output is correct
44 Correct 152 ms 12020 KB Output is correct
45 Correct 132 ms 11996 KB Output is correct
46 Correct 158 ms 13140 KB Output is correct
47 Correct 94 ms 11624 KB Output is correct
48 Correct 108 ms 11664 KB Output is correct
49 Correct 132 ms 10712 KB Output is correct
50 Correct 99 ms 11468 KB Output is correct
51 Correct 90 ms 11896 KB Output is correct
52 Correct 116 ms 11576 KB Output is correct