oj.uz

답안 #892147

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
892147 2023-12-25T01:22:45 Z box Two Antennas (JOI19_antennas) C++17
100 / 100
 456 ms 37060 KB 
#include <bits/stdc++.h>
using namespace std;

#define ar array
#define sz(v) int(std::size(v))
using i64 = long long;

const int N = 2e5, Q = 2e5, INF = 1e9;
const int N_ = 1 << 18;

int n;
int h[N], dl[N], dr[N];
vector<pair<int, bool>> upd[N + 1];
int q;
int ans[Q];
vector<pair<int, int>> qry[N];

struct {
    int max_dif[N_ * 2];
    int min_active[N_ * 2];
    int max_put[N_ * 2];
    void bld(int k, int l, int r) {
        max_dif[k] = -1;
        min_active[k] = INF;
        max_put[k] = -INF;
        if (l < r) {
            int m = (l + r) / 2;
            bld(k * 2, l, m), bld(k * 2 + 1, m + 1, r);
        }
    }
    void bld() { bld(1, 0, n - 1); }
    void pull(int k) {
        min_active[k] = min(min_active[k * 2], min_active[k * 2 + 1]);
        max_dif[k] = max(max_dif[k * 2], max_dif[k * 2 + 1]);
    }
    void put(int k, int x) {
        max_put[k] = max(max_put[k], x);
        max_dif[k] = max(max_dif[k], x - min_active[k]);
    }
    void push(int k) {
        if (max_put[k] != -INF) {
            put(k * 2, max_put[k]), put(k * 2 + 1, max_put[k]);
            max_put[k] = -INF;
        }
    }
    void set_point(int k, int l, int r, int i, int x) {
        if (l == r) min_active[k] = x;
        else {
            int m = (l + r) / 2;
            push(k);
            i <= m ? set_point(k * 2, l, m, i, x) : set_point(k * 2 + 1, m + 1, r, i, x);
            pull(k);
        }
    }
    void put_range(int k, int l, int r, int ql, int qr, int x) {
        if (ql <= l && qr >= r) put(k, x);
        else {
            int m = (l + r) / 2;
            push(k);
            if (ql <= m) put_range(k * 2, l, m, ql, qr, x);
            if (qr > m) put_range(k * 2 + 1, m + 1, r, ql, qr, x);
            pull(k);
        }
    }
    int qry(int k, int l, int r, int ql, int qr) {
        if (ql <= l && qr >= r) return max_dif[k];
        int m = (l + r) / 2;
        push(k);
        return max(ql <= m ? qry(k * 2, l, m, ql, qr) : -1, qr > m ? qry(k * 2 + 1, m + 1, r, ql, qr) : -1);
    }
    void set_point(int i, int x) { set_point(1, 0, n - 1, i, x); }
    void put_range(int l, int r, int x) { put_range(1, 0, n - 1, l, r, x); }
    int qry(int l, int r) { return qry(1, 0, n - 1, l, r); }
} seg;

void solve() {
    seg.bld(1, 0, n - 1);
    for (int i = 0; i < n; i++) {
        for (auto [j, type] : upd[i])
            seg.set_point(j, type ? h[j] : INF);
        if (i - dl[i] >= 0) seg.put_range(max(0, i - dr[i]), i - dl[i], h[i]);
        for (auto [h, l] : qry[i]) ans[h] = max(ans[h], seg.qry(l, i));
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> h[i] >> dl[i] >> dr[i];
        upd[min(n, i + dl[i])].push_back({i, 1});
        upd[min(n, i + dr[i] + 1)].push_back({i, 0});
    }
    cin >> q;
    for (int h = 0; h < q; h++) {
        int l, r;
        cin >> l >> r, l--, r--;
        qry[r].push_back({h, l});
        ans[h] = -1;
    }
    solve();
    for (int i = 0; i < n; i++) h[i] *= -1;
    solve();
    for (int h = 0; h < q; h++) cout << ans[h] << '\n';
}

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 19036 KB Output is correct
2 Correct 4 ms 19048 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 19084 KB Output is correct
5 Correct 4 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 4 ms 19036 KB Output is correct
8 Correct 3 ms 19036 KB Output is correct
9 Correct 4 ms 19036 KB Output is correct
10 Correct 4 ms 19120 KB Output is correct
11 Correct 3 ms 19080 KB Output is correct
12 Correct 4 ms 19048 KB Output is correct
13 Correct 4 ms 19036 KB Output is correct
14 Correct 4 ms 19036 KB Output is correct
15 Correct 3 ms 19036 KB Output is correct
16 Correct 3 ms 19036 KB Output is correct
17 Correct 4 ms 19084 KB Output is correct
18 Correct 4 ms 19032 KB Output is correct
19 Correct 4 ms 19036 KB Output is correct
20 Correct 4 ms 19032 KB Output is correct
21 Correct 4 ms 19032 KB Output is correct
22 Correct 4 ms 19032 KB Output is correct
23 Correct 3 ms 19036 KB Output is correct
24 Correct 4 ms 19036 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 19036 KB Output is correct
2 Correct 4 ms 19048 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 19084 KB Output is correct
5 Correct 4 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 4 ms 19036 KB Output is correct
8 Correct 3 ms 19036 KB Output is correct
9 Correct 4 ms 19036 KB Output is correct
10 Correct 4 ms 19120 KB Output is correct
11 Correct 3 ms 19080 KB Output is correct
12 Correct 4 ms 19048 KB Output is correct
13 Correct 4 ms 19036 KB Output is correct
14 Correct 4 ms 19036 KB Output is correct
15 Correct 3 ms 19036 KB Output is correct
16 Correct 3 ms 19036 KB Output is correct
17 Correct 4 ms 19084 KB Output is correct
18 Correct 4 ms 19032 KB Output is correct
19 Correct 4 ms 19036 KB Output is correct
20 Correct 4 ms 19032 KB Output is correct
21 Correct 4 ms 19032 KB Output is correct
22 Correct 4 ms 19032 KB Output is correct
23 Correct 3 ms 19036 KB Output is correct
24 Correct 4 ms 19036 KB Output is correct
25 Correct 57 ms 23224 KB Output is correct
26 Correct 12 ms 19544 KB Output is correct
27 Correct 91 ms 25048 KB Output is correct
28 Correct 86 ms 25032 KB Output is correct
29 Correct 57 ms 23136 KB Output is correct
30 Correct 60 ms 23080 KB Output is correct
31 Correct 69 ms 24056 KB Output is correct
32 Correct 92 ms 25172 KB Output is correct
33 Correct 77 ms 24700 KB Output is correct
34 Correct 45 ms 21840 KB Output is correct
35 Correct 89 ms 24916 KB Output is correct
36 Correct 86 ms 25172 KB Output is correct
37 Correct 49 ms 21840 KB Output is correct
38 Correct 85 ms 24240 KB Output is correct
39 Correct 16 ms 19800 KB Output is correct
40 Correct 83 ms 24144 KB Output is correct
41 Correct 61 ms 22856 KB Output is correct
42 Correct 82 ms 24144 KB Output is correct
43 Correct 35 ms 20820 KB Output is correct
44 Correct 82 ms 24148 KB Output is correct
45 Correct 18 ms 19804 KB Output is correct
46 Correct 88 ms 24144 KB Output is correct
47 Correct 30 ms 20264 KB Output is correct
48 Correct 82 ms 24276 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 200 ms 27608 KB Output is correct
2 Correct 224 ms 28608 KB Output is correct
3 Correct 164 ms 25788 KB Output is correct
4 Correct 246 ms 28604 KB Output is correct
5 Correct 94 ms 23240 KB Output is correct
6 Correct 237 ms 28612 KB Output is correct
7 Correct 190 ms 27332 KB Output is correct
8 Correct 220 ms 28636 KB Output is correct
9 Correct 34 ms 20432 KB Output is correct
10 Correct 225 ms 28660 KB Output is correct
11 Correct 134 ms 25028 KB Output is correct
12 Correct 223 ms 28664 KB Output is correct
13 Correct 174 ms 27364 KB Output is correct
14 Correct 145 ms 27148 KB Output is correct
15 Correct 147 ms 26940 KB Output is correct
16 Correct 131 ms 27516 KB Output is correct
17 Correct 166 ms 27392 KB Output is correct
18 Correct 146 ms 27464 KB Output is correct
19 Correct 161 ms 26844 KB Output is correct
20 Correct 148 ms 27124 KB Output is correct
21 Correct 138 ms 26748 KB Output is correct
22 Correct 146 ms 26924 KB Output is correct
23 Correct 153 ms 27332 KB Output is correct
24 Correct 131 ms 27068 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 19036 KB Output is correct
2 Correct 4 ms 19048 KB Output is correct
3 Correct 4 ms 19036 KB Output is correct
4 Correct 4 ms 19084 KB Output is correct
5 Correct 4 ms 19036 KB Output is correct
6 Correct 3 ms 19036 KB Output is correct
7 Correct 4 ms 19036 KB Output is correct
8 Correct 3 ms 19036 KB Output is correct
9 Correct 4 ms 19036 KB Output is correct
10 Correct 4 ms 19120 KB Output is correct
11 Correct 3 ms 19080 KB Output is correct
12 Correct 4 ms 19048 KB Output is correct
13 Correct 4 ms 19036 KB Output is correct
14 Correct 4 ms 19036 KB Output is correct
15 Correct 3 ms 19036 KB Output is correct
16 Correct 3 ms 19036 KB Output is correct
17 Correct 4 ms 19084 KB Output is correct
18 Correct 4 ms 19032 KB Output is correct
19 Correct 4 ms 19036 KB Output is correct
20 Correct 4 ms 19032 KB Output is correct
21 Correct 4 ms 19032 KB Output is correct
22 Correct 4 ms 19032 KB Output is correct
23 Correct 3 ms 19036 KB Output is correct
24 Correct 4 ms 19036 KB Output is correct
25 Correct 57 ms 23224 KB Output is correct
26 Correct 12 ms 19544 KB Output is correct
27 Correct 91 ms 25048 KB Output is correct
28 Correct 86 ms 25032 KB Output is correct
29 Correct 57 ms 23136 KB Output is correct
30 Correct 60 ms 23080 KB Output is correct
31 Correct 69 ms 24056 KB Output is correct
32 Correct 92 ms 25172 KB Output is correct
33 Correct 77 ms 24700 KB Output is correct
34 Correct 45 ms 21840 KB Output is correct
35 Correct 89 ms 24916 KB Output is correct
36 Correct 86 ms 25172 KB Output is correct
37 Correct 49 ms 21840 KB Output is correct
38 Correct 85 ms 24240 KB Output is correct
39 Correct 16 ms 19800 KB Output is correct
40 Correct 83 ms 24144 KB Output is correct
41 Correct 61 ms 22856 KB Output is correct
42 Correct 82 ms 24144 KB Output is correct
43 Correct 35 ms 20820 KB Output is correct
44 Correct 82 ms 24148 KB Output is correct
45 Correct 18 ms 19804 KB Output is correct
46 Correct 88 ms 24144 KB Output is correct
47 Correct 30 ms 20264 KB Output is correct
48 Correct 82 ms 24276 KB Output is correct
49 Correct 200 ms 27608 KB Output is correct
50 Correct 224 ms 28608 KB Output is correct
51 Correct 164 ms 25788 KB Output is correct
52 Correct 246 ms 28604 KB Output is correct
53 Correct 94 ms 23240 KB Output is correct
54 Correct 237 ms 28612 KB Output is correct
55 Correct 190 ms 27332 KB Output is correct
56 Correct 220 ms 28636 KB Output is correct
57 Correct 34 ms 20432 KB Output is correct
58 Correct 225 ms 28660 KB Output is correct
59 Correct 134 ms 25028 KB Output is correct
60 Correct 223 ms 28664 KB Output is correct
61 Correct 174 ms 27364 KB Output is correct
62 Correct 145 ms 27148 KB Output is correct
63 Correct 147 ms 26940 KB Output is correct
64 Correct 131 ms 27516 KB Output is correct
65 Correct 166 ms 27392 KB Output is correct
66 Correct 146 ms 27464 KB Output is correct
67 Correct 161 ms 26844 KB Output is correct
68 Correct 148 ms 27124 KB Output is correct
69 Correct 138 ms 26748 KB Output is correct
70 Correct 146 ms 26924 KB Output is correct
71 Correct 153 ms 27332 KB Output is correct
72 Correct 131 ms 27068 KB Output is correct
73 Correct 336 ms 34100 KB Output is correct
74 Correct 245 ms 29396 KB Output is correct
75 Correct 324 ms 33676 KB Output is correct
76 Correct 456 ms 37052 KB Output is correct
77 Correct 205 ms 28952 KB Output is correct
78 Correct 374 ms 34492 KB Output is correct
79 Correct 388 ms 35436 KB Output is correct
80 Correct 411 ms 37060 KB Output is correct
81 Correct 162 ms 27084 KB Output is correct
82 Correct 306 ms 33120 KB Output is correct
83 Correct 298 ms 32568 KB Output is correct
84 Correct 428 ms 36960 KB Output is correct
85 Correct 254 ms 31420 KB Output is correct
86 Correct 319 ms 34276 KB Output is correct
87 Correct 178 ms 28116 KB Output is correct
88 Correct 305 ms 34636 KB Output is correct
89 Correct 310 ms 32316 KB Output is correct
90 Correct 311 ms 34632 KB Output is correct
91 Correct 212 ms 29640 KB Output is correct
92 Correct 293 ms 34408 KB Output is correct
93 Correct 182 ms 28220 KB Output is correct
94 Correct 305 ms 34264 KB Output is correct
95 Correct 205 ms 29032 KB Output is correct
96 Correct 283 ms 34112 KB Output is correct