oj.uz

Submission #723527

# Submission time Handle Problem Language Result Execution time Memory
723527 2023-04-14T02:59:05 Z joelgun14 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 204 ms 13888 KB 
#include <bits/stdc++.h>
#define endl "\n"
using namespace std;
const int lim = 2e5 + 5;
struct fenwick {
    long long a[lim];
    fenwick() {
        memset(a, 0, sizeof(a));
    }
    void upd(int idx, long long val) {
        if(idx == 0)
            return;
        while(idx < lim) {
            a[idx] += val;
            idx += idx&-idx;
        }
    }
    long long q(int idx) {
        long long res = 0;
        while(idx) {
            res += a[idx];
            idx -= idx&-idx;
        }
        return res;
    }
    long long q(int l, int r) {
        return q(r) - q(l - 1);
    }
};
int main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    int n, q;
    long long s, t;
    cin >> n >> q >> s >> t;
    // make 2 bit
    // one bit to check for difference array stuff
    // other bit to check for sum of degree change
    int input[n + 1];
    cin >> input[0];
    fenwick diff, sum;
    for(int i = 1; i <= n; ++i)
        cin >> input[i], diff.upd(i, input[i] - input[i - 1]);
    for(int i = 1; i <= n; ++i) {
        if(input[i] > input[i - 1]) {
            sum.upd(i, -(input[i] - input[i - 1]) * s);
        }
        else {
            sum.upd(i, -(input[i] - input[i - 1]) * t);
        }
    }
    for(int query = 1; query <= q; ++query) {
        int l, r, x;
        cin >> l >> r >> x;
        diff.upd(l, x);
        diff.upd(r + 1, -x);
        // l nya di update dengan previous
        sum.upd(l, -sum.q(l, l));
        if(diff.q(l) > diff.q(l - 1)) {
            sum.upd(l, -(diff.q(l) - diff.q(l - 1)) * s);
        }
        else {
            sum.upd(l, -(diff.q(l) - diff.q(l - 1)) * t);
        }
        // r nya di update dengan next, ubah ke sumnya
        if(r != n) {
            //cout << diff.q(r + 1) << " " << diff.q(r) << endl;
            sum.upd(r + 1, -sum.q(r + 1, r + 1));
            if(diff.q(r + 1) > diff.q(r)) {
                sum.upd(r + 1, -(diff.q(r + 1) - diff.q(r)) * s);
            }
            else {
                sum.upd(r + 1, -(diff.q(r + 1) - diff.q(r)) * t);
            }
        }
        cout << sum.q(n) << endl;
    }
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3464 KB Output is correct
2 Correct 3 ms 3412 KB Output is correct
3 Correct 4 ms 3540 KB Output is correct
4 Correct 4 ms 3412 KB Output is correct
5 Correct 4 ms 3540 KB Output is correct
6 Correct 4 ms 3540 KB Output is correct
7 Correct 3 ms 3540 KB Output is correct
8 Correct 3 ms 3524 KB Output is correct
9 Correct 3 ms 3540 KB Output is correct
10 Correct 5 ms 3412 KB Output is correct
11 Correct 5 ms 3540 KB Output is correct
12 Correct 4 ms 3540 KB Output is correct
13 Correct 4 ms 3468 KB Output is correct
14 Correct 4 ms 3508 KB Output is correct
15 Correct 3 ms 3492 KB Output is correct
16 Correct 3 ms 3540 KB Output is correct
17 Correct 3 ms 3412 KB Output is correct
18 Correct 3 ms 3540 KB Output is correct
19 Correct 3 ms 3452 KB Output is correct
20 Correct 2 ms 3412 KB Output is correct
21 Correct 2 ms 3412 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 155 ms 10980 KB Output is correct
2 Correct 204 ms 11616 KB Output is correct
3 Correct 150 ms 12276 KB Output is correct
4 Correct 150 ms 11588 KB Output is correct
5 Correct 176 ms 12720 KB Output is correct
6 Correct 118 ms 11764 KB Output is correct
7 Correct 121 ms 11808 KB Output is correct
8 Correct 160 ms 12736 KB Output is correct
9 Correct 154 ms 13024 KB Output is correct
10 Correct 135 ms 11632 KB Output is correct
11 Correct 116 ms 11692 KB Output is correct
12 Correct 125 ms 12440 KB Output is correct
13 Correct 104 ms 12700 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 3464 KB Output is correct
2 Correct 3 ms 3412 KB Output is correct
3 Correct 4 ms 3540 KB Output is correct
4 Correct 4 ms 3412 KB Output is correct
5 Correct 4 ms 3540 KB Output is correct
6 Correct 4 ms 3540 KB Output is correct
7 Correct 3 ms 3540 KB Output is correct
8 Correct 3 ms 3524 KB Output is correct
9 Correct 3 ms 3540 KB Output is correct
10 Correct 5 ms 3412 KB Output is correct
11 Correct 5 ms 3540 KB Output is correct
12 Correct 4 ms 3540 KB Output is correct
13 Correct 4 ms 3468 KB Output is correct
14 Correct 4 ms 3508 KB Output is correct
15 Correct 3 ms 3492 KB Output is correct
16 Correct 3 ms 3540 KB Output is correct
17 Correct 3 ms 3412 KB Output is correct
18 Correct 3 ms 3540 KB Output is correct
19 Correct 3 ms 3452 KB Output is correct
20 Correct 2 ms 3412 KB Output is correct
21 Correct 2 ms 3412 KB Output is correct
22 Correct 155 ms 10980 KB Output is correct
23 Correct 204 ms 11616 KB Output is correct
24 Correct 150 ms 12276 KB Output is correct
25 Correct 150 ms 11588 KB Output is correct
26 Correct 176 ms 12720 KB Output is correct
27 Correct 118 ms 11764 KB Output is correct
28 Correct 121 ms 11808 KB Output is correct
29 Correct 160 ms 12736 KB Output is correct
30 Correct 154 ms 13024 KB Output is correct
31 Correct 135 ms 11632 KB Output is correct
32 Correct 116 ms 11692 KB Output is correct
33 Correct 125 ms 12440 KB Output is correct
34 Correct 104 ms 12700 KB Output is correct
35 Correct 169 ms 11124 KB Output is correct
36 Correct 156 ms 12728 KB Output is correct
37 Correct 149 ms 13432 KB Output is correct
38 Correct 163 ms 13176 KB Output is correct
39 Correct 152 ms 13200 KB Output is correct
40 Correct 167 ms 13172 KB Output is correct
41 Correct 160 ms 13168 KB Output is correct
42 Correct 163 ms 13132 KB Output is correct
43 Correct 162 ms 12472 KB Output is correct
44 Correct 178 ms 12784 KB Output is correct
45 Correct 153 ms 12868 KB Output is correct
46 Correct 171 ms 13888 KB Output is correct
47 Correct 112 ms 12396 KB Output is correct
48 Correct 129 ms 12432 KB Output is correct
49 Correct 152 ms 11624 KB Output is correct
50 Correct 125 ms 12240 KB Output is correct
51 Correct 112 ms 12660 KB Output is correct
52 Correct 131 ms 12400 KB Output is correct