oj.uz

답안 #332889

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
332889 2020-12-04T00:02:37 Z 12tqian Two Antennas (JOI19_antennas) C++17
100 / 100
 1375 ms 35180 KB 
#include <bits/stdc++.h>

const int INF = 1e9;

template <class T> struct LazySeg {
    int sz;
    std::vector<T> c; // stores max of c
    std::vector<T> d; // stores max of d
    std::vector<T> lazy; // stores what you subtract max with
    void init(int n) {
        sz = 1;
        while (sz < n) sz *= 2;
        c.assign(2 * sz, -INF);
        d.assign(2 * sz, -INF);
        lazy.assign(2 * sz, -INF);
    }   
    void pull(int ind) {
        c[ind] = std::max(c[2 * ind], c[2 * ind + 1]);
        d[ind] = std::max(d[2 * ind], d[2 * ind + 1]);
    }
    void push(int ind, int L, int R) {
        d[ind] = std::max(d[ind], c[ind] + lazy[ind]);
        if (L != R) {
            lazy[2 * ind] = std::max(lazy[2 * ind], lazy[ind]);
            lazy[2 * ind + 1] = std::max(lazy[2 * ind + 1], lazy[ind]);
        }
        lazy[ind] = -INF;
    }
    void set(int p, T val, int ind = 1, int L = 0, int R = -1) {
        if (R == -1) R += sz;   
        push(ind, L, R);
        if (p < L || R < p) return; 
        if (L == R) {
            c[ind] = val;
            push(ind, L, R);    
            return;
        }
        int M = (L + R) / 2;
        set(p, val, 2 * ind, L, M);
        set(p, val, 2 * ind + 1, M + 1, R);
        pull(ind);
    }
    void set_max(int lo, int hi, T val, int ind = 1, int L = 0, int R = -1) {
        if (R == -1) R += sz;
        push(ind, L, R);
        if (R < lo || hi < L) return;
        if (lo <= L && R <= hi) {
            lazy[ind] = val;
            push(ind, L, R);
            return;
        }
        int M = (L + R) / 2;
        set_max(lo, hi, val, 2 * ind, L, M);
        set_max(lo, hi, val, 2 * ind + 1, M + 1, R);
        pull(ind);
    }
    T qmax(int t, int lo, int hi, int ind = 1, int L = 0, int R = -1) {
        if (R == -1) R += sz;
        push(ind, L, R);    
        if (R < lo || hi < L) return -INF;
        if (lo <= L && R <= hi) return (t == 0 ? c[ind] : d[ind]);
        int M = (L + R) / 2;
        return std::max(qmax(t, lo, hi, 2 * ind, L, M), qmax(t, lo, hi, 2 * ind + 1, M + 1, R));
    }
};

int main() {
    using namespace std;
    ios_base::sync_with_stdio(0);
    int n; cin >> n;
    vector<int> h(n), a(n), b(n);
    for (int i = 0; i < n; i++) 
        cin >> h[i] >> a[i] >> b[i];
    int q; cin >> q;
    vector<array<int, 2>> queries(q);
    for (int i = 0; i < q; i++)
        cin >> queries[i][0] >> queries[i][1], queries[i][0]--, queries[i][1]--;
    vector<int> ans(q, -1);
    LazySeg<int> seg;
    int tt = 0;
    auto solve = [&]() {
        tt++;
        seg.init(n);
        vector<vector<array<int, 2>>> events(n);
        for (int i = 0; i < n; i++) {
            if (i + a[i] < n)
                events[i + a[i]].push_back({1, i});
            if (i + b[i] < n)
                events[i + b[i]].push_back({3, i});
            events[i].push_back({2, i});
        }
        for (int i = 0; i < q; i++) 
            events[queries[i][1]].push_back({4, i});
        for (auto& v : events)
            sort(v.begin(), v.end());        
        for (int j = 0; j < n; j++) {
            for (auto& e : events[j]) {
                int id = e[1];
                if (e[0] == 1) {
                    seg.set(id, h[id]);
                } else if (e[0] == 2) {
                    int l = max(0, j - b[id]);
                    int r = j - a[id];
                    if (l <= r) {
                        seg.set_max(l, r, -h[id]);
                    }
                } else if (e[0] == 3) {
                    seg.set(id, -INF);
                } else if (e[0] == 4) {
                    int l = queries[id][0];
                    int r = queries[id][1];
                    ans[id] = max(ans[id], seg.qmax(1, l, r));
                }
            }
        }
    };
    solve();
    reverse(a.begin(), a.end());
    reverse(b.begin(), b.end());
    reverse(h.begin(), h.end());
    for (int i = 0; i < q; i++) {
        queries[i][0] = n - 1 - queries[i][0];
        queries[i][1] = n - 1 - queries[i][1];
        swap(queries[i][0], queries[i][1]);
    }
    solve();
    for (int i = 0; i < q; i++)
        cout << ans[i] << '\n';
    return 0;
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 49 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 38 ms 376 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 160 ms 5304 KB Output is correct
26 Correct 21 ms 1260 KB Output is correct
27 Correct 253 ms 7688 KB Output is correct
28 Correct 244 ms 8000 KB Output is correct
29 Correct 165 ms 5492 KB Output is correct
30 Correct 163 ms 6480 KB Output is correct
31 Correct 195 ms 6680 KB Output is correct
32 Correct 246 ms 7892 KB Output is correct
33 Correct 230 ms 7212 KB Output is correct
34 Correct 120 ms 4844 KB Output is correct
35 Correct 259 ms 7572 KB Output is correct
36 Correct 245 ms 8000 KB Output is correct
37 Correct 139 ms 4844 KB Output is correct
38 Correct 244 ms 7276 KB Output is correct
39 Correct 34 ms 1644 KB Output is correct
40 Correct 241 ms 7148 KB Output is correct
41 Correct 175 ms 5972 KB Output is correct
42 Correct 246 ms 7276 KB Output is correct
43 Correct 81 ms 3040 KB Output is correct
44 Correct 250 ms 7404 KB Output is correct
45 Correct 42 ms 1804 KB Output is correct
46 Correct 249 ms 7412 KB Output is correct
47 Correct 62 ms 2540 KB Output is correct
48 Correct 243 ms 7276 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 563 ms 20332 KB Output is correct
2 Correct 638 ms 21740 KB Output is correct
3 Correct 415 ms 17548 KB Output is correct
4 Correct 640 ms 21740 KB Output is correct
5 Correct 245 ms 11248 KB Output is correct
6 Correct 648 ms 21744 KB Output is correct
7 Correct 535 ms 19948 KB Output is correct
8 Correct 659 ms 21800 KB Output is correct
9 Correct 67 ms 3844 KB Output is correct
10 Correct 640 ms 21780 KB Output is correct
11 Correct 345 ms 13424 KB Output is correct
12 Correct 643 ms 21780 KB Output is correct
13 Correct 571 ms 23832 KB Output is correct
14 Correct 515 ms 24060 KB Output is correct
15 Correct 498 ms 23980 KB Output is correct
16 Correct 501 ms 24000 KB Output is correct
17 Correct 579 ms 23904 KB Output is correct
18 Correct 523 ms 23888 KB Output is correct
19 Correct 542 ms 23960 KB Output is correct
20 Correct 524 ms 23788 KB Output is correct
21 Correct 526 ms 23904 KB Output is correct
22 Correct 530 ms 23848 KB Output is correct
23 Correct 541 ms 23924 KB Output is correct
24 Correct 507 ms 23872 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 364 KB Output is correct
10 Correct 1 ms 364 KB Output is correct
11 Correct 1 ms 364 KB Output is correct
12 Correct 1 ms 364 KB Output is correct
13 Correct 1 ms 364 KB Output is correct
14 Correct 1 ms 364 KB Output is correct
15 Correct 1 ms 364 KB Output is correct
16 Correct 1 ms 364 KB Output is correct
17 Correct 1 ms 364 KB Output is correct
18 Correct 1 ms 364 KB Output is correct
19 Correct 49 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 2 ms 384 KB Output is correct
22 Correct 38 ms 376 KB Output is correct
23 Correct 1 ms 384 KB Output is correct
24 Correct 1 ms 384 KB Output is correct
25 Correct 160 ms 5304 KB Output is correct
26 Correct 21 ms 1260 KB Output is correct
27 Correct 253 ms 7688 KB Output is correct
28 Correct 244 ms 8000 KB Output is correct
29 Correct 165 ms 5492 KB Output is correct
30 Correct 163 ms 6480 KB Output is correct
31 Correct 195 ms 6680 KB Output is correct
32 Correct 246 ms 7892 KB Output is correct
33 Correct 230 ms 7212 KB Output is correct
34 Correct 120 ms 4844 KB Output is correct
35 Correct 259 ms 7572 KB Output is correct
36 Correct 245 ms 8000 KB Output is correct
37 Correct 139 ms 4844 KB Output is correct
38 Correct 244 ms 7276 KB Output is correct
39 Correct 34 ms 1644 KB Output is correct
40 Correct 241 ms 7148 KB Output is correct
41 Correct 175 ms 5972 KB Output is correct
42 Correct 246 ms 7276 KB Output is correct
43 Correct 81 ms 3040 KB Output is correct
44 Correct 250 ms 7404 KB Output is correct
45 Correct 42 ms 1804 KB Output is correct
46 Correct 249 ms 7412 KB Output is correct
47 Correct 62 ms 2540 KB Output is correct
48 Correct 243 ms 7276 KB Output is correct
49 Correct 563 ms 20332 KB Output is correct
50 Correct 638 ms 21740 KB Output is correct
51 Correct 415 ms 17548 KB Output is correct
52 Correct 640 ms 21740 KB Output is correct
53 Correct 245 ms 11248 KB Output is correct
54 Correct 648 ms 21744 KB Output is correct
55 Correct 535 ms 19948 KB Output is correct
56 Correct 659 ms 21800 KB Output is correct
57 Correct 67 ms 3844 KB Output is correct
58 Correct 640 ms 21780 KB Output is correct
59 Correct 345 ms 13424 KB Output is correct
60 Correct 643 ms 21780 KB Output is correct
61 Correct 571 ms 23832 KB Output is correct
62 Correct 515 ms 24060 KB Output is correct
63 Correct 498 ms 23980 KB Output is correct
64 Correct 501 ms 24000 KB Output is correct
65 Correct 579 ms 23904 KB Output is correct
66 Correct 523 ms 23888 KB Output is correct
67 Correct 542 ms 23960 KB Output is correct
68 Correct 524 ms 23788 KB Output is correct
69 Correct 526 ms 23904 KB Output is correct
70 Correct 530 ms 23848 KB Output is correct
71 Correct 541 ms 23924 KB Output is correct
72 Correct 507 ms 23872 KB Output is correct
73 Correct 1106 ms 30956 KB Output is correct
74 Correct 736 ms 25876 KB Output is correct
75 Correct 1041 ms 29336 KB Output is correct
76 Correct 1375 ms 35180 KB Output is correct
77 Correct 633 ms 19100 KB Output is correct
78 Correct 1137 ms 31892 KB Output is correct
79 Correct 1173 ms 32588 KB Output is correct
80 Correct 1317 ms 33760 KB Output is correct
81 Correct 433 ms 12928 KB Output is correct
82 Correct 977 ms 30176 KB Output is correct
83 Correct 923 ms 24680 KB Output is correct
84 Correct 1337 ms 33812 KB Output is correct
85 Correct 944 ms 31068 KB Output is correct
86 Correct 1200 ms 34684 KB Output is correct
87 Correct 652 ms 27420 KB Output is correct
88 Correct 1203 ms 34156 KB Output is correct
89 Correct 1085 ms 31712 KB Output is correct
90 Correct 1193 ms 32964 KB Output is correct
91 Correct 787 ms 28852 KB Output is correct
92 Correct 1193 ms 32936 KB Output is correct
93 Correct 667 ms 27872 KB Output is correct
94 Correct 1195 ms 33052 KB Output is correct
95 Correct 714 ms 28428 KB Output is correct
96 Correct 1132 ms 33004 KB Output is correct