oj.uz

Submission #113638

# Submission time Handle Problem Language Result Execution time Memory
113638 2019-05-27T09:28:09 Z popovicirobert Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 206 ms 12308 KB 
#include <bits/stdc++.h>
#define lsb(x) (x & (-x))
#define ll long long
#define ull unsigned long long
// 217
// 44

using namespace std;

struct Fenwick {
    vector <ll> aib;
    int n;

    inline void init(int _n) {
        n = _n;
        aib.resize(n + 1, 0);
    }

    inline void update(int pos, int val) {
        for(int i = pos; i <= n; i += lsb(i)) {
            aib[i] += val;
        }
    }

    inline ll query(int pos) {
        ll ans = 0;
        for(int i = pos; i > 0; i -= lsb(i)) {
            ans += aib[i];
        }
        return ans;
    }

};

inline ll get(ll h1, ll h2, int s, int t) {
    if(h1 < h2) return -1LL * (h2 - h1) * s;

    return 1LL * (h1 - h2) * t;
}


int main() {
    //ifstream cin("A.in");
    //ofstream cout("A.out");
    int i, n, q, s, t;
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

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

    ll cur = 0;

    vector <int> a(n + 2);
    for(i = 1; i <= n + 1; i++) {
        cin >> a[i];
        if(i > 1) {
            cur += get(a[i - 1], a[i], s, t);
        }
    }

    Fenwick fen; fen.init(n + 1);

    while(q > 0) {
        q--;

        int l, r, x;

        cin >> l >> r >> x;
        l++, r++;

        if(l > 1) {
            cur -= get(a[l - 1] + fen.query(l - 1), a[l] + fen.query(l), s, t);
        }
        if(r <= n) {
            cur -= get(a[r] + fen.query(r), a[r + 1] + fen.query(r + 1), s, t);
        }

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

        if(l >= 1) {
            cur += get(a[l - 1] + fen.query(l - 1), a[l] + fen.query(l), s, t);
        }
        if(r <= n) {
            cur += get(a[r] + fen.query(r), a[r + 1] + fen.query(r + 1), s, t);
        }

        cout << cur << "\n";
    }

    //cin.close();
    //cout.close();
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 3 ms 356 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 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 161 ms 4100 KB Output is correct
2 Correct 156 ms 4728 KB Output is correct
3 Correct 171 ms 5240 KB Output is correct
4 Correct 147 ms 4656 KB Output is correct
5 Correct 154 ms 5184 KB Output is correct
6 Correct 104 ms 5624 KB Output is correct
7 Correct 107 ms 5624 KB Output is correct
8 Correct 145 ms 5496 KB Output is correct
9 Correct 150 ms 5880 KB Output is correct
10 Correct 138 ms 4732 KB Output is correct
11 Correct 101 ms 5644 KB Output is correct
12 Correct 101 ms 5980 KB Output is correct
13 Correct 105 ms 11256 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 384 KB Output is correct
2 Correct 3 ms 384 KB Output is correct
3 Correct 3 ms 640 KB Output is correct
4 Correct 3 ms 384 KB Output is correct
5 Correct 3 ms 384 KB Output is correct
6 Correct 4 ms 384 KB Output is correct
7 Correct 3 ms 356 KB Output is correct
8 Correct 3 ms 384 KB Output is correct
9 Correct 3 ms 384 KB Output is correct
10 Correct 4 ms 384 KB Output is correct
11 Correct 3 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 4 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 2 ms 384 KB Output is correct
18 Correct 3 ms 384 KB Output is correct
19 Correct 2 ms 256 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 161 ms 4100 KB Output is correct
23 Correct 156 ms 4728 KB Output is correct
24 Correct 171 ms 5240 KB Output is correct
25 Correct 147 ms 4656 KB Output is correct
26 Correct 154 ms 5184 KB Output is correct
27 Correct 104 ms 5624 KB Output is correct
28 Correct 107 ms 5624 KB Output is correct
29 Correct 145 ms 5496 KB Output is correct
30 Correct 150 ms 5880 KB Output is correct
31 Correct 138 ms 4732 KB Output is correct
32 Correct 101 ms 5644 KB Output is correct
33 Correct 101 ms 5980 KB Output is correct
34 Correct 105 ms 11256 KB Output is correct
35 Correct 161 ms 9820 KB Output is correct
36 Correct 159 ms 11000 KB Output is correct
37 Correct 165 ms 12008 KB Output is correct
38 Correct 160 ms 11640 KB Output is correct
39 Correct 177 ms 11640 KB Output is correct
40 Correct 206 ms 11712 KB Output is correct
41 Correct 153 ms 11512 KB Output is correct
42 Correct 163 ms 11512 KB Output is correct
43 Correct 155 ms 11048 KB Output is correct
44 Correct 155 ms 11256 KB Output is correct
45 Correct 144 ms 11356 KB Output is correct
46 Correct 147 ms 12308 KB Output is correct
47 Correct 108 ms 10872 KB Output is correct
48 Correct 111 ms 10884 KB Output is correct
49 Correct 132 ms 9976 KB Output is correct
50 Correct 103 ms 10744 KB Output is correct
51 Correct 102 ms 11128 KB Output is correct
52 Correct 106 ms 11000 KB Output is correct