oj.uz

Submission #669705

# Submission time Handle Problem Language Result Execution time Memory
669705 2022-12-07T06:17:32 Z GrandTiger1729 Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 133 ms 7232 KB 
#include <iostream>
#include <vector>
using namespace std;

struct BIT{
    vector<long long> bit;
    int n;
    BIT(int _n): n(_n){
        bit.resize(n + 1);
    }
    void add(int p, long long u){
        for (int i = p; i <= n; i += i & -i){
            bit[i] += u;
        }
    }
    long long query(int p){
        long long ret = 0;
        for (int i = p; i > 0; i -= i & -i){
            ret += bit[i];
        }
        return ret;
    }
};

int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n, q;
    long long S, T; 
    cin >> n >> q >> S >> T;
    n++;
    long long a[n]{};
    for (int i = 0; i < n; i++){
        cin >> a[i];
    }
    auto val = [&](long long x, long long y) -> long long {
        if (x < y) return (x - y) * S;
        return (x - y) * T;
    };
    long long ans = 0;
    for (int i = 1; i < n; i++){
        ans += val(a[i - 1], a[i]);
    }
    BIT bit(n);
    for (int i = 1; i < n; i++){
        bit.add(i, a[i] - a[i - 1]);
    }
    while (q--){
        int l, r; cin >> l >> r;
        long long u; cin >> u;
        ans -= val(bit.query(l - 1), bit.query(l));
        if (r + 1 < n)
            ans -= val(bit.query(r), bit.query(r + 1));
        bit.add(l, u);
        if (r + 1 < n)
            bit.add(r + 1, -u);
        ans += val(bit.query(l - 1), bit.query(l));
        if (r + 1 < n)
            ans += val(bit.query(r), bit.query(r + 1));
        cout << ans << '\n';
    }
    return 0;
}

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 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 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 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 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 125 ms 4820 KB Output is correct
2 Correct 133 ms 5428 KB Output is correct
3 Correct 124 ms 6092 KB Output is correct
4 Correct 123 ms 5128 KB Output is correct
5 Correct 121 ms 5968 KB Output is correct
6 Correct 84 ms 6348 KB Output is correct
7 Correct 85 ms 6348 KB Output is correct
8 Correct 112 ms 6264 KB Output is correct
9 Correct 131 ms 6604 KB Output is correct
10 Correct 109 ms 5316 KB Output is correct
11 Correct 84 ms 6456 KB Output is correct
12 Correct 85 ms 6728 KB Output is correct
13 Correct 81 ms 7124 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 340 KB Output is correct
4 Correct 2 ms 340 KB Output is correct
5 Correct 2 ms 340 KB Output is correct
6 Correct 1 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 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 1 ms 340 KB Output is correct
13 Correct 1 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 1 ms 340 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 125 ms 4820 KB Output is correct
23 Correct 133 ms 5428 KB Output is correct
24 Correct 124 ms 6092 KB Output is correct
25 Correct 123 ms 5128 KB Output is correct
26 Correct 121 ms 5968 KB Output is correct
27 Correct 84 ms 6348 KB Output is correct
28 Correct 85 ms 6348 KB Output is correct
29 Correct 112 ms 6264 KB Output is correct
30 Correct 131 ms 6604 KB Output is correct
31 Correct 109 ms 5316 KB Output is correct
32 Correct 84 ms 6456 KB Output is correct
33 Correct 85 ms 6728 KB Output is correct
34 Correct 81 ms 7124 KB Output is correct
35 Correct 118 ms 5028 KB Output is correct
36 Correct 132 ms 6544 KB Output is correct
37 Correct 127 ms 7232 KB Output is correct
38 Correct 122 ms 6964 KB Output is correct
39 Correct 130 ms 7048 KB Output is correct
40 Correct 122 ms 6988 KB Output is correct
41 Correct 124 ms 6816 KB Output is correct
42 Correct 127 ms 6936 KB Output is correct
43 Correct 124 ms 6236 KB Output is correct
44 Correct 123 ms 6628 KB Output is correct
45 Correct 125 ms 6424 KB Output is correct
46 Correct 128 ms 7012 KB Output is correct
47 Correct 87 ms 6944 KB Output is correct
48 Correct 98 ms 7176 KB Output is correct
49 Correct 115 ms 6224 KB Output is correct
50 Correct 91 ms 6996 KB Output is correct
51 Correct 84 ms 6940 KB Output is correct
52 Correct 92 ms 6972 KB Output is correct