oj.uz

답안 #224408

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
224408 2020-04-17T19:11:43 Z DS007 Foehn Phenomena (JOI17_foehn_phenomena) C++14
100 / 100
 653 ms 24188 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

const int N = 2e5 + 5;

class seg_tree {
    int *t, *lazy;
    int n;

public:
    seg_tree() {
        t = new int[1];
        lazy = new int[1];
    }

    void build(int v, int l, int r, int a[]) {
        if (l == r) {
            t[v] = a[l];
            return;
        }

        int mid = (l + r) / 2;
        build(v * 2, l, mid, a);
        build(v * 2 + 1, mid + 1, r, a);
        t[v] = t[v * 2] + t[v * 2 + 1];
    }

    void build(int n_, int a[]) {
        n = n_;
        t = new int[n * 8 + 8];
        lazy = new int[n * 8 + 8];

        build(1, 0, n, a);
        fill(lazy, lazy + 4 * n, 0);
    }

    void push_down(int v, int l, int r) {
        t[v] += lazy[v] * (r - l + 1);
        lazy[v * 2] += lazy[v];
        lazy[v * 2 + 1] += lazy[v];
        lazy[v] = 0;
    }

    int query(int v, int l, int r, int tl) {
        push_down(v, l, r);
        if (l == r && l == tl)
            return t[v];
        int mid = (l + r) / 2;
        if (tl <= mid)
            return query(v * 2, l, mid, tl);
        else
            return query(v * 2 + 1, mid + 1, r, tl);
    }

    void update(int v, int l, int r, int tl, int tr, int x) {
        push_down(v, l, r);
        if (tl > tr) {
            return;
        } else if (l == tl && r == tr) {
            lazy[v] += x;
            push_down(v, l, r);
            return;
        }

        int mid = (l + r) / 2;
        update(v * 2, l, mid, tl, min(tr, mid), x);
        update(v * 2 + 1, mid + 1, r, max(mid + 1, tl), tr, x);
    }
};

int n, q, s, t, cur;
int a[N];
seg_tree st;

void adjust(int x, int y, int off) {
    if (x < y)
        cur -= off * s * (y - x);
    else
        cur += off * t * (x - y);
}

void solveTestCase() {
    cin >> n >> q >> s >> t;
    for (int i = 0; i <= n; i++) cin >> a[i];
    st.build(n, a);

    for (int i = 1; i <= n; i++)
        adjust(a[i - 1], a[i], 1);

    for (int i = 0; i < q; i++) {
        int l, r, x;
        cin >> l >> r >> x;

        int left = st.query(1, 0, n, l - 1), pl = st.query(1, 0, n, l), cl = pl + x;
        adjust(left, pl, -1);
        adjust(left, cl, 1);

        if (r != n) {
            int right = st.query(1, 0, n, r + 1), pr = st.query(1, 0, n, r), cr = pr + x;
            adjust(pr, right, -1);
            adjust(cr, right, 1);
        }

        st.update(1, 0, n, l, r, x);
        cout << cur << "\n";
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

    int test = 1;
    // cin >> test;
    for (int i = 1; i <= test; i++)
        solveTestCase();
}

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 7 ms 512 KB Output is correct
3 Correct 8 ms 512 KB Output is correct
4 Correct 7 ms 512 KB Output is correct
5 Correct 7 ms 512 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 8 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 7 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 7 ms 512 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 466 ms 15736 KB Output is correct
2 Correct 437 ms 16560 KB Output is correct
3 Correct 413 ms 17016 KB Output is correct
4 Correct 423 ms 21836 KB Output is correct
5 Correct 418 ms 22776 KB Output is correct
6 Correct 491 ms 19960 KB Output is correct
7 Correct 480 ms 19960 KB Output is correct
8 Correct 351 ms 22648 KB Output is correct
9 Correct 365 ms 23008 KB Output is correct
10 Correct 350 ms 21724 KB Output is correct
11 Correct 357 ms 19832 KB Output is correct
12 Correct 449 ms 20600 KB Output is correct
13 Correct 435 ms 20856 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 512 KB Output is correct
2 Correct 7 ms 512 KB Output is correct
3 Correct 8 ms 512 KB Output is correct
4 Correct 7 ms 512 KB Output is correct
5 Correct 7 ms 512 KB Output is correct
6 Correct 7 ms 512 KB Output is correct
7 Correct 7 ms 512 KB Output is correct
8 Correct 7 ms 512 KB Output is correct
9 Correct 8 ms 512 KB Output is correct
10 Correct 8 ms 512 KB Output is correct
11 Correct 7 ms 640 KB Output is correct
12 Correct 7 ms 512 KB Output is correct
13 Correct 6 ms 512 KB Output is correct
14 Correct 6 ms 512 KB Output is correct
15 Correct 7 ms 512 KB Output is correct
16 Correct 7 ms 512 KB Output is correct
17 Correct 6 ms 512 KB Output is correct
18 Correct 7 ms 512 KB Output is correct
19 Correct 5 ms 384 KB Output is correct
20 Correct 4 ms 384 KB Output is correct
21 Correct 5 ms 384 KB Output is correct
22 Correct 466 ms 15736 KB Output is correct
23 Correct 437 ms 16560 KB Output is correct
24 Correct 413 ms 17016 KB Output is correct
25 Correct 423 ms 21836 KB Output is correct
26 Correct 418 ms 22776 KB Output is correct
27 Correct 491 ms 19960 KB Output is correct
28 Correct 480 ms 19960 KB Output is correct
29 Correct 351 ms 22648 KB Output is correct
30 Correct 365 ms 23008 KB Output is correct
31 Correct 350 ms 21724 KB Output is correct
32 Correct 357 ms 19832 KB Output is correct
33 Correct 449 ms 20600 KB Output is correct
34 Correct 435 ms 20856 KB Output is correct
35 Correct 415 ms 21240 KB Output is correct
36 Correct 424 ms 22776 KB Output is correct
37 Correct 429 ms 23544 KB Output is correct
38 Correct 435 ms 23428 KB Output is correct
39 Correct 438 ms 23288 KB Output is correct
40 Correct 425 ms 23372 KB Output is correct
41 Correct 432 ms 23160 KB Output is correct
42 Correct 471 ms 23160 KB Output is correct
43 Correct 424 ms 22568 KB Output is correct
44 Correct 423 ms 22904 KB Output is correct
45 Correct 417 ms 22976 KB Output is correct
46 Correct 433 ms 24188 KB Output is correct
47 Correct 515 ms 20568 KB Output is correct
48 Correct 275 ms 20600 KB Output is correct
49 Correct 416 ms 21752 KB Output is correct
50 Correct 352 ms 20344 KB Output is correct
51 Correct 442 ms 20728 KB Output is correct
52 Correct 653 ms 20472 KB Output is correct