oj.uz

답안 #140524

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
140524 2019-08-03T10:55:43 Z meatrow Foehn Phenomena (JOI17_foehn_phenomena) C++17
100 / 100
 486 ms 15868 KB 
//#pragma GCC optimize("O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

const int N = 2e5;

ll t[N * 4];
ll a[N];

void build(ll a[], int v, int tl, int tr) {
    if (tl == tr) {
        t[v] = a[tl];
    } else {
        int tm = (tl + tr) / 2;
        build(a, v*2, tl, tm);
        build(a, v*2+1, tm+1, tr);
        t[v] = 0;
    }
}

void update(int v, int tl, int tr, int l, int r, int add) {
    if (l > r)
        return;
    if (l == tl && r == tr) {
        t[v] += add;
    } else {
        int tm = (tl + tr) / 2;
        update(v*2, tl, tm, l, min(r, tm), add);
        update(v*2+1, tm+1, tr, max(l, tm+1), r, add);
    }
}

ll get(int v, int tl, int tr, int pos) {
    if (tl == tr)
        return t[v];
    int tm = (tl + tr) / 2;
    if (pos <= tm)
        return t[v] + get(v*2, tl, tm, pos);
    else
        return t[v] + get(v*2+1, tm+1, tr, pos);
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, q, s, t;
    cin >> n >> q >> s >> t;
    n++;
    ll down = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        if (i) {
            if (a[i] < a[i - 1]) {
                down -= a[i] - a[i - 1];
            }
        } 
    }
    build(a, 1, 0, n - 1);
    while (q--) {
        int l, r, x;
        cin >> l >> r >> x;
        ll a1 = get(1, 0, n - 1, l - 1);
        ll b1 = get(1, 0, n - 1, l);
        ll a2 = get(1, 0, n - 1, r);
        ll b2 = get(1, 0, n - 1, r + 1);
        if (b1 < a1) {
            down += b1 - a1;
        }
        if (r + 1 < n && b2 < a2) {
            down += b2 - a2;
        }
        update(1, 0, n - 1, l, r, x);
        a1 = get(1, 0, n - 1, l - 1);
        b1 = get(1, 0, n - 1, l);
        a2 = get(1, 0, n - 1, r);
        b2 = get(1, 0, n - 1, r + 1);
        if (b1 < a1) {
            down -= b1 - a1;
        }
        if (r + 1 < n && b2 < a2) {
            down -= b2 - a2;
        }
        cout << t * down - s * (get(1, 0, n - 1, n - 1) + down) << '\n';

    }
    return 0;
}

Subtask #1
30.0 / 30.0

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

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 424 ms 12816 KB Output is correct
2 Correct 486 ms 13592 KB Output is correct
3 Correct 460 ms 14096 KB Output is correct
4 Correct 480 ms 13612 KB Output is correct
5 Correct 432 ms 14768 KB Output is correct
6 Correct 217 ms 13744 KB Output is correct
7 Correct 217 ms 13560 KB Output is correct
8 Correct 378 ms 14584 KB Output is correct
9 Correct 378 ms 14676 KB Output is correct
10 Correct 387 ms 13604 KB Output is correct
11 Correct 205 ms 13572 KB Output is correct
12 Correct 221 ms 14328 KB Output is correct
13 Correct 212 ms 14456 KB Output is correct

Subtask #3
60.0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 504 KB Output is correct
2 Correct 5 ms 504 KB Output is correct
3 Correct 5 ms 504 KB Output is correct
4 Correct 5 ms 504 KB Output is correct
5 Correct 5 ms 504 KB Output is correct
6 Correct 5 ms 504 KB Output is correct
7 Correct 5 ms 504 KB Output is correct
8 Correct 5 ms 504 KB Output is correct
9 Correct 5 ms 504 KB Output is correct
10 Correct 5 ms 504 KB Output is correct
11 Correct 5 ms 504 KB Output is correct
12 Correct 5 ms 504 KB Output is correct
13 Correct 4 ms 504 KB Output is correct
14 Correct 4 ms 552 KB Output is correct
15 Correct 5 ms 504 KB Output is correct
16 Correct 4 ms 504 KB Output is correct
17 Correct 4 ms 504 KB Output is correct
18 Correct 4 ms 504 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 376 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 424 ms 12816 KB Output is correct
23 Correct 486 ms 13592 KB Output is correct
24 Correct 460 ms 14096 KB Output is correct
25 Correct 480 ms 13612 KB Output is correct
26 Correct 432 ms 14768 KB Output is correct
27 Correct 217 ms 13744 KB Output is correct
28 Correct 217 ms 13560 KB Output is correct
29 Correct 378 ms 14584 KB Output is correct
30 Correct 378 ms 14676 KB Output is correct
31 Correct 387 ms 13604 KB Output is correct
32 Correct 205 ms 13572 KB Output is correct
33 Correct 221 ms 14328 KB Output is correct
34 Correct 212 ms 14456 KB Output is correct
35 Correct 427 ms 13044 KB Output is correct
36 Correct 422 ms 14556 KB Output is correct
37 Correct 438 ms 15180 KB Output is correct
38 Correct 429 ms 15128 KB Output is correct
39 Correct 432 ms 15096 KB Output is correct
40 Correct 428 ms 15144 KB Output is correct
41 Correct 425 ms 15096 KB Output is correct
42 Correct 433 ms 14960 KB Output is correct
43 Correct 429 ms 14328 KB Output is correct
44 Correct 424 ms 14712 KB Output is correct
45 Correct 424 ms 14820 KB Output is correct
46 Correct 431 ms 15868 KB Output is correct
47 Correct 216 ms 14300 KB Output is correct
48 Correct 203 ms 14200 KB Output is correct
49 Correct 408 ms 13376 KB Output is correct
50 Correct 208 ms 14136 KB Output is correct
51 Correct 215 ms 14620 KB Output is correct
52 Correct 230 ms 14328 KB Output is correct