oj.uz

답안 #332882

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
332882 2020-12-03T23:49:39 Z 12tqian Two Antennas (JOI19_antennas) C++17
100 / 100
 1253 ms 35220 KB 
#include <bits/stdc++.h>

using namespace std;
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 2 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 384 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 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 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 2 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 384 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 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 161 ms 5388 KB Output is correct
26 Correct 22 ms 1260 KB Output is correct
27 Correct 250 ms 7828 KB Output is correct
28 Correct 259 ms 7920 KB Output is correct
29 Correct 168 ms 5660 KB Output is correct
30 Correct 160 ms 6352 KB Output is correct
31 Correct 198 ms 6680 KB Output is correct
32 Correct 242 ms 7888 KB Output is correct
33 Correct 227 ms 7064 KB Output is correct
34 Correct 113 ms 4588 KB Output is correct
35 Correct 237 ms 7696 KB Output is correct
36 Correct 259 ms 7896 KB Output is correct
37 Correct 143 ms 4972 KB Output is correct
38 Correct 252 ms 7276 KB Output is correct
39 Correct 35 ms 1644 KB Output is correct
40 Correct 239 ms 7276 KB Output is correct
41 Correct 174 ms 6140 KB Output is correct
42 Correct 240 ms 7404 KB Output is correct
43 Correct 78 ms 3080 KB Output is correct
44 Correct 242 ms 7276 KB Output is correct
45 Correct 42 ms 1900 KB Output is correct
46 Correct 241 ms 7360 KB Output is correct
47 Correct 62 ms 2540 KB Output is correct
48 Correct 246 ms 7404 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 591 ms 23296 KB Output is correct
2 Correct 644 ms 25236 KB Output is correct
3 Correct 414 ms 19848 KB Output is correct
4 Correct 636 ms 25236 KB Output is correct
5 Correct 240 ms 11892 KB Output is correct
6 Correct 625 ms 25324 KB Output is correct
7 Correct 556 ms 22764 KB Output is correct
8 Correct 630 ms 25364 KB Output is correct
9 Correct 68 ms 4100 KB Output is correct
10 Correct 637 ms 25364 KB Output is correct
11 Correct 339 ms 15088 KB Output is correct
12 Correct 646 ms 25444 KB Output is correct
13 Correct 562 ms 26392 KB Output is correct
14 Correct 522 ms 26376 KB Output is correct
15 Correct 499 ms 26412 KB Output is correct
16 Correct 494 ms 26348 KB Output is correct
17 Correct 577 ms 26336 KB Output is correct
18 Correct 523 ms 26320 KB Output is correct
19 Correct 536 ms 26508 KB Output is correct
20 Correct 525 ms 26220 KB Output is correct
21 Correct 532 ms 26348 KB Output is correct
22 Correct 535 ms 26536 KB Output is correct
23 Correct 521 ms 26508 KB Output is correct
24 Correct 489 ms 26596 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 2 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 384 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 1 ms 364 KB Output is correct
20 Correct 1 ms 364 KB Output is correct
21 Correct 1 ms 364 KB Output is correct
22 Correct 1 ms 364 KB Output is correct
23 Correct 1 ms 364 KB Output is correct
24 Correct 1 ms 364 KB Output is correct
25 Correct 161 ms 5388 KB Output is correct
26 Correct 22 ms 1260 KB Output is correct
27 Correct 250 ms 7828 KB Output is correct
28 Correct 259 ms 7920 KB Output is correct
29 Correct 168 ms 5660 KB Output is correct
30 Correct 160 ms 6352 KB Output is correct
31 Correct 198 ms 6680 KB Output is correct
32 Correct 242 ms 7888 KB Output is correct
33 Correct 227 ms 7064 KB Output is correct
34 Correct 113 ms 4588 KB Output is correct
35 Correct 237 ms 7696 KB Output is correct
36 Correct 259 ms 7896 KB Output is correct
37 Correct 143 ms 4972 KB Output is correct
38 Correct 252 ms 7276 KB Output is correct
39 Correct 35 ms 1644 KB Output is correct
40 Correct 239 ms 7276 KB Output is correct
41 Correct 174 ms 6140 KB Output is correct
42 Correct 240 ms 7404 KB Output is correct
43 Correct 78 ms 3080 KB Output is correct
44 Correct 242 ms 7276 KB Output is correct
45 Correct 42 ms 1900 KB Output is correct
46 Correct 241 ms 7360 KB Output is correct
47 Correct 62 ms 2540 KB Output is correct
48 Correct 246 ms 7404 KB Output is correct
49 Correct 591 ms 23296 KB Output is correct
50 Correct 644 ms 25236 KB Output is correct
51 Correct 414 ms 19848 KB Output is correct
52 Correct 636 ms 25236 KB Output is correct
53 Correct 240 ms 11892 KB Output is correct
54 Correct 625 ms 25324 KB Output is correct
55 Correct 556 ms 22764 KB Output is correct
56 Correct 630 ms 25364 KB Output is correct
57 Correct 68 ms 4100 KB Output is correct
58 Correct 637 ms 25364 KB Output is correct
59 Correct 339 ms 15088 KB Output is correct
60 Correct 646 ms 25444 KB Output is correct
61 Correct 562 ms 26392 KB Output is correct
62 Correct 522 ms 26376 KB Output is correct
63 Correct 499 ms 26412 KB Output is correct
64 Correct 494 ms 26348 KB Output is correct
65 Correct 577 ms 26336 KB Output is correct
66 Correct 523 ms 26320 KB Output is correct
67 Correct 536 ms 26508 KB Output is correct
68 Correct 525 ms 26220 KB Output is correct
69 Correct 532 ms 26348 KB Output is correct
70 Correct 535 ms 26536 KB Output is correct
71 Correct 521 ms 26508 KB Output is correct
72 Correct 489 ms 26596 KB Output is correct
73 Correct 974 ms 30860 KB Output is correct
74 Correct 672 ms 26132 KB Output is correct
75 Correct 939 ms 29448 KB Output is correct
76 Correct 1253 ms 35220 KB Output is correct
77 Correct 598 ms 19184 KB Output is correct
78 Correct 1029 ms 32020 KB Output is correct
79 Correct 1094 ms 32668 KB Output is correct
80 Correct 1205 ms 35220 KB Output is correct
81 Correct 415 ms 13008 KB Output is correct
82 Correct 895 ms 30100 KB Output is correct
83 Correct 898 ms 24700 KB Output is correct
84 Correct 1195 ms 35208 KB Output is correct
85 Correct 913 ms 31400 KB Output is correct
86 Correct 1111 ms 34684 KB Output is correct
87 Correct 586 ms 27440 KB Output is correct
88 Correct 1124 ms 34140 KB Output is correct
89 Correct 1038 ms 32480 KB Output is correct
90 Correct 1187 ms 34456 KB Output is correct
91 Correct 764 ms 28940 KB Output is correct
92 Correct 1153 ms 34472 KB Output is correct
93 Correct 635 ms 27872 KB Output is correct
94 Correct 1158 ms 34460 KB Output is correct
95 Correct 687 ms 28416 KB Output is correct
96 Correct 1087 ms 34356 KB Output is correct