oj.uz

Submission #523986

# Submission time Handle Problem Language Result Execution time Memory
523986 2022-02-08T14:05:56 Z FireGhost1301 Foehn Phenomena (JOI17_foehn_phenomena) C++11
100 / 100
 251 ms 14052 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 2e5 + 3;
int n, q, s, t, a[N];
int sz;
long long seg[4 * N];

void init() {
    sz = 1;
    while (sz <= n + 1) sz <<= 1;
}

void build(int x = 0, int lx = 0, int rx = sz) {
    if (rx - lx == 1) {
        if (lx <= n) seg[x] = a[lx];
        return;
    }
    int mid = (lx + rx) >> 1;
    build(2 * x + 1, lx, mid);
    build(2 * x + 2, mid, rx);
}

void upd(int l, int r, int v, int x = 0, int lx = 0, int rx = sz) {
    if (lx >= r || rx <= l) return;
    if (lx >= l && rx <= r) {
        seg[x] += v;
        return;
    }
    int mid = (lx + rx) >> 1;
    upd(l, r, v, 2 * x + 1, lx, mid);
    upd(l, r, v, 2 * x + 2, mid, rx);
}

long long get(int p, int x = 0, int lx = 0, int rx = sz) {
    if (rx - lx == 1) return seg[x];
    int mid = (lx + rx) >> 1;
    long long ans = seg[x];
    if (p < mid) ans += get(p, 2 * x + 1, lx, mid);
    else ans += get(p, 2 * x + 2, mid, rx);
    return ans;
}

void solve() {
    cin >> n >> q >> s >> t;
    for (int i = 0; i <= n; ++i)
        cin >> a[i];
    long long cur_ans = 0;
    for (int i = 0; i < n; ++i) {
        if (a[i] < a[i + 1]) cur_ans -= 1LL * s * (a[i + 1] - a[i]);
        else cur_ans += 1LL * t * (a[i] - a[i + 1]);
    }
    init(), build();
    while (q--) {
        int l, r, v; cin >> l >> r >> v;
        long long k1 = get(l - 1), k2 = get(l);
        long long z1 = get(r), z2 = LLONG_MIN;
        if (r != n) z2 = get(r + 1);
        upd(l, r + 1, v);
        if (k1 < k2) cur_ans += 1LL * s * (k2 - k1);
        else cur_ans -= 1LL * t * (k1 - k2);
        if (z2 != LLONG_MIN) {
            if (z1 < z2) cur_ans += 1LL * s * (z2 - z1);
            else cur_ans -= 1LL * t * (z1 - z2);
        }
        k2 += v, z1 += v;
        if (k1 < k2) cur_ans -= 1LL * s * (k2 - k1);
        else cur_ans += 1LL * t * (k1 - k2);
        if (z2 != LLONG_MIN) {
            if (z1 < z2) cur_ans -= 1LL * s * (z2 - z1);
            else cur_ans += 1LL * t * (z1 - z2);
        }
        cout << cur_ans << '\n';
    }
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
    return 0;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 328 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 225 ms 10624 KB Output is correct
2 Correct 225 ms 11640 KB Output is correct
3 Correct 232 ms 12192 KB Output is correct
4 Correct 220 ms 11608 KB Output is correct
5 Correct 221 ms 12856 KB Output is correct
6 Correct 135 ms 10328 KB Output is correct
7 Correct 126 ms 10180 KB Output is correct
8 Correct 205 ms 12608 KB Output is correct
9 Correct 206 ms 13100 KB Output is correct
10 Correct 201 ms 11660 KB Output is correct
11 Correct 118 ms 10204 KB Output is correct
12 Correct 130 ms 10840 KB Output is correct
13 Correct 130 ms 11068 KB Output is correct

Subtask #3
60.0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct
2 Correct 2 ms 332 KB Output is correct
3 Correct 2 ms 328 KB Output is correct
4 Correct 2 ms 332 KB Output is correct
5 Correct 2 ms 332 KB Output is correct
6 Correct 2 ms 332 KB Output is correct
7 Correct 2 ms 332 KB Output is correct
8 Correct 2 ms 332 KB Output is correct
9 Correct 3 ms 332 KB Output is correct
10 Correct 2 ms 332 KB Output is correct
11 Correct 3 ms 332 KB Output is correct
12 Correct 3 ms 332 KB Output is correct
13 Correct 2 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 2 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 2 ms 332 KB Output is correct
18 Correct 2 ms 332 KB Output is correct
19 Correct 1 ms 204 KB Output is correct
20 Correct 1 ms 204 KB Output is correct
21 Correct 1 ms 204 KB Output is correct
22 Correct 225 ms 10624 KB Output is correct
23 Correct 225 ms 11640 KB Output is correct
24 Correct 232 ms 12192 KB Output is correct
25 Correct 220 ms 11608 KB Output is correct
26 Correct 221 ms 12856 KB Output is correct
27 Correct 135 ms 10328 KB Output is correct
28 Correct 126 ms 10180 KB Output is correct
29 Correct 205 ms 12608 KB Output is correct
30 Correct 206 ms 13100 KB Output is correct
31 Correct 201 ms 11660 KB Output is correct
32 Correct 118 ms 10204 KB Output is correct
33 Correct 130 ms 10840 KB Output is correct
34 Correct 130 ms 11068 KB Output is correct
35 Correct 226 ms 11116 KB Output is correct
36 Correct 226 ms 12612 KB Output is correct
37 Correct 230 ms 13376 KB Output is correct
38 Correct 225 ms 13200 KB Output is correct
39 Correct 251 ms 13276 KB Output is correct
40 Correct 223 ms 13228 KB Output is correct
41 Correct 228 ms 13248 KB Output is correct
42 Correct 226 ms 13192 KB Output is correct
43 Correct 233 ms 12484 KB Output is correct
44 Correct 230 ms 12872 KB Output is correct
45 Correct 217 ms 12860 KB Output is correct
46 Correct 236 ms 14052 KB Output is correct
47 Correct 127 ms 10948 KB Output is correct
48 Correct 125 ms 11036 KB Output is correct
49 Correct 224 ms 11428 KB Output is correct
50 Correct 124 ms 10764 KB Output is correct
51 Correct 221 ms 11072 KB Output is correct
52 Correct 140 ms 10944 KB Output is correct