oj.uz

Submission #557924

# Submission time Handle Problem Language Result Execution time Memory
557924 2022-05-06T10:09:46 Z alextodoran Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 214 ms 12264 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N_MAX = 200000;

int N, Q, S, T;
int A[N_MAX + 2];

ll Fen[N_MAX + 2];
void update (int pos, int val) {
    for (int i = pos; i <= N; i += i & -i) {
        Fen[i] += val;
    }
}
void update (int l, int r, int val) {
    update(l, val);
    update(r + 1, -val);
}
ll query (int pos) {
    ll val = 0;
    for (int i = pos; i >= 1; i -= i & -i) {
        val += Fen[i];
    }
    return val;
}

ll f (int i) {
    if (1 <= i && i <= N) {
        ll x = query(i - 1), y = query(i);
        return (x - y) * (x < y ? S : T);
    } else {
        return 0;
    }
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> N >> Q >> S >> T;
    for (int i = 0; i <= N; i++) {
        cin >> A[i];
    }
    for (int i = 1; i <= N; i++) {
        update(i, i, A[i]);
    }
    ll answer = 0;
    for (int i = 1; i <= N; i++) {
        answer += f(i);
    }

    while (Q--) {
        int l, r, val;
        cin >> l >> r >> val;
        answer -= f(l) + f(r + 1);
        update(l, r, val);
        answer += f(l) + f(r + 1);
        cout << answer << "\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 3 ms 412 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 173 ms 8780 KB Output is correct
2 Correct 214 ms 10112 KB Output is correct
3 Correct 161 ms 10676 KB Output is correct
4 Correct 165 ms 10092 KB Output is correct
5 Correct 166 ms 11220 KB Output is correct
6 Correct 116 ms 10272 KB Output is correct
7 Correct 135 ms 10144 KB Output is correct
8 Correct 174 ms 10968 KB Output is correct
9 Correct 151 ms 11364 KB Output is correct
10 Correct 196 ms 10092 KB Output is correct
11 Correct 136 ms 10176 KB Output is correct
12 Correct 125 ms 10816 KB Output is correct
13 Correct 124 ms 11088 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 3 ms 412 KB Output is correct
3 Correct 2 ms 340 KB Output is correct
4 Correct 3 ms 340 KB Output is correct
5 Correct 3 ms 340 KB Output is correct
6 Correct 3 ms 340 KB Output is correct
7 Correct 2 ms 340 KB Output is correct
8 Correct 3 ms 340 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 2 ms 340 KB Output is correct
11 Correct 3 ms 340 KB Output is correct
12 Correct 3 ms 340 KB Output is correct
13 Correct 2 ms 340 KB Output is correct
14 Correct 2 ms 340 KB Output is correct
15 Correct 2 ms 340 KB Output is correct
16 Correct 2 ms 340 KB Output is correct
17 Correct 2 ms 340 KB Output is correct
18 Correct 2 ms 340 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 384 KB Output is correct
22 Correct 173 ms 8780 KB Output is correct
23 Correct 214 ms 10112 KB Output is correct
24 Correct 161 ms 10676 KB Output is correct
25 Correct 165 ms 10092 KB Output is correct
26 Correct 166 ms 11220 KB Output is correct
27 Correct 116 ms 10272 KB Output is correct
28 Correct 135 ms 10144 KB Output is correct
29 Correct 174 ms 10968 KB Output is correct
30 Correct 151 ms 11364 KB Output is correct
31 Correct 196 ms 10092 KB Output is correct
32 Correct 136 ms 10176 KB Output is correct
33 Correct 125 ms 10816 KB Output is correct
34 Correct 124 ms 11088 KB Output is correct
35 Correct 168 ms 9608 KB Output is correct
36 Correct 184 ms 11008 KB Output is correct
37 Correct 164 ms 11844 KB Output is correct
38 Correct 177 ms 11648 KB Output is correct
39 Correct 175 ms 11668 KB Output is correct
40 Correct 173 ms 11620 KB Output is correct
41 Correct 164 ms 11468 KB Output is correct
42 Correct 175 ms 11516 KB Output is correct
43 Correct 155 ms 10772 KB Output is correct
44 Correct 144 ms 11192 KB Output is correct
45 Correct 137 ms 11236 KB Output is correct
46 Correct 142 ms 12264 KB Output is correct
47 Correct 107 ms 10860 KB Output is correct
48 Correct 126 ms 10872 KB Output is correct
49 Correct 126 ms 9892 KB Output is correct
50 Correct 132 ms 10836 KB Output is correct
51 Correct 103 ms 11088 KB Output is correct
52 Correct 104 ms 10796 KB Output is correct