oj.uz

답안 #789473

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
789473 2023-07-21T12:28:10 Z someone Two Antennas (JOI19_antennas) C++14
100 / 100
 496 ms 63140 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;

const int M = 1 << 18, N = 2 * M, INF = 1e12 + 42;

struct Node {
    int maxi = -1, maxVal = -INF, minVal = INF, maxTag = -INF, minTag = INF;
};

Node node[N];
vector<int> req[M], upd[N];
int n, q, h[M], a[M], b[M], debReq[M], ans[M];

inline void applyOp(int i, int minTag, int maxTag) {
    node[i].minTag = min(node[i].minTag, minTag);
    node[i].maxTag = max(node[i].maxTag, maxTag);
    node[i].maxi = max(node[i].maxi, node[i].maxVal - minTag);
    node[i].maxi = max(node[i].maxi, maxTag - node[i].minVal);
}

void propage(int i) {
    applyOp(i*2, node[i].minTag, node[i].maxTag);
    applyOp(i*2+1, node[i].minTag, node[i].maxTag);
    node[i].minTag = INF, node[i].maxTag = -INF;
}

void update(int i, int deb, int fin, int l, int r, int newVal) {
    if(fin <= l || r <= deb)
        return;
    if(l <= deb && fin <= r) {
        applyOp(i, newVal, newVal);
        return;
    }
    propage(i);
    int mid = ((deb +  fin) >> 1);
    update(i*2, deb, mid, l, r, newVal);
    update(i*2+1, mid, fin, l, r, newVal);
    node[i].maxi = max(node[i*2].maxi, node[i*2+1].maxi);
}

void setVal(int i, int deb, int fin, int pos, int minVal, int maxVal) {
    if(fin <= pos || pos < deb)
        return;
    if(fin - deb == 1) {
        node[i].minVal = minVal;
        node[i].maxVal = maxVal;
        return;
    }
    propage(i);
    int mid = ((deb +  fin) >> 1);
    setVal(i*2, deb, mid, pos, minVal, maxVal);
    setVal(i*2+1, mid, fin, pos, minVal, maxVal);
    node[i].minVal = min(node[i*2].minVal, node[i*2+1].minVal);
    node[i].maxVal = max(node[i*2].maxVal, node[i*2+1].maxVal);
}

int getMax(int i, int deb, int fin, int l, int r) {
    if(fin <= l || r <= deb)
        return -1;
    if(l <= deb && fin <= r)
        return node[i].maxi;
    propage(i);
    int mid = ((deb +  fin) >> 1),
        val = max(getMax(i*2, deb, mid, l, r),
                  getMax(i*2+1, mid, fin, l, r));
    return val;
}

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


    cin >> n;
    for(int i = 0; i < n; i++)
        cin >> h[i] >> a[i] >> b[i];
    cin >> q;
    for(int i = 0; i < q; i++) {
        int fin; cin >> debReq[i] >> fin;
        debReq[i]--, fin--;
        req[fin].push_back(i);
    }
    for(int i = 0; i < n; i++) {
        for(int j : upd[i]) {
            if(j >= 0) {
                setVal(1, 0, M, j, h[j], h[j]);
            } else {
                setVal(1, 0, M, -j-1, INF, -INF);
            }
        }
        update(1, 0, M, i - b[i], i - a[i] + 1, h[i]);
        for(int j : req[i])
            ans[j] = getMax(1, 0, M, debReq[j], i);

        upd[i + a[i]].push_back(i);
        upd[i + b[i] + 1].push_back(-i-1);
    }
    for(int i = 0; i < q; i++)
        cout << ans[i] << '\n';
}

Subtask #1
2.0 / 2.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 18900 KB Output is correct
2 Correct 8 ms 18900 KB Output is correct
3 Correct 9 ms 18900 KB Output is correct
4 Correct 9 ms 18832 KB Output is correct
5 Correct 12 ms 18936 KB Output is correct
6 Correct 9 ms 18928 KB Output is correct
7 Correct 9 ms 18936 KB Output is correct
8 Correct 10 ms 18900 KB Output is correct
9 Correct 9 ms 18800 KB Output is correct
10 Correct 8 ms 18900 KB Output is correct
11 Correct 8 ms 18900 KB Output is correct
12 Correct 9 ms 18900 KB Output is correct
13 Correct 8 ms 18900 KB Output is correct
14 Correct 8 ms 18928 KB Output is correct
15 Correct 9 ms 18900 KB Output is correct
16 Correct 9 ms 18900 KB Output is correct
17 Correct 9 ms 18900 KB Output is correct
18 Correct 11 ms 18900 KB Output is correct
19 Correct 8 ms 18900 KB Output is correct
20 Correct 8 ms 18900 KB Output is correct
21 Correct 9 ms 18900 KB Output is correct
22 Correct 8 ms 18936 KB Output is correct
23 Correct 8 ms 18900 KB Output is correct
24 Correct 8 ms 18900 KB Output is correct
25 Correct 76 ms 25440 KB Output is correct
26 Correct 20 ms 19784 KB Output is correct
27 Correct 105 ms 28108 KB Output is correct
28 Correct 105 ms 28212 KB Output is correct
29 Correct 84 ms 25436 KB Output is correct
30 Correct 75 ms 25200 KB Output is correct
31 Correct 94 ms 27116 KB Output is correct
32 Correct 105 ms 28236 KB Output is correct
33 Correct 102 ms 27556 KB Output is correct
34 Correct 56 ms 23428 KB Output is correct
35 Correct 105 ms 28108 KB Output is correct
36 Correct 109 ms 28236 KB Output is correct
37 Correct 64 ms 23800 KB Output is correct
38 Correct 103 ms 27304 KB Output is correct
39 Correct 28 ms 20232 KB Output is correct
40 Correct 104 ms 27256 KB Output is correct
41 Correct 78 ms 25036 KB Output is correct
42 Correct 122 ms 27240 KB Output is correct
43 Correct 48 ms 21748 KB Output is correct
44 Correct 106 ms 27256 KB Output is correct
45 Correct 26 ms 20476 KB Output is correct
46 Correct 140 ms 27324 KB Output is correct
47 Correct 37 ms 21284 KB Output is correct
48 Correct 105 ms 27248 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 245 ms 48172 KB Output is correct
2 Correct 275 ms 51584 KB Output is correct
3 Correct 161 ms 41788 KB Output is correct
4 Correct 249 ms 51444 KB Output is correct
5 Correct 92 ms 33712 KB Output is correct
6 Correct 251 ms 51580 KB Output is correct
7 Correct 200 ms 47096 KB Output is correct
8 Correct 289 ms 51572 KB Output is correct
9 Correct 35 ms 23884 KB Output is correct
10 Correct 253 ms 51560 KB Output is correct
11 Correct 159 ms 39308 KB Output is correct
12 Correct 243 ms 51528 KB Output is correct
13 Correct 165 ms 41612 KB Output is correct
14 Correct 147 ms 41252 KB Output is correct
15 Correct 145 ms 42004 KB Output is correct
16 Correct 164 ms 43572 KB Output is correct
17 Correct 164 ms 41984 KB Output is correct
18 Correct 158 ms 42788 KB Output is correct
19 Correct 170 ms 41264 KB Output is correct
20 Correct 186 ms 41436 KB Output is correct
21 Correct 146 ms 41352 KB Output is correct
22 Correct 152 ms 42116 KB Output is correct
23 Correct 167 ms 41280 KB Output is correct
24 Correct 146 ms 42052 KB Output is correct

Subtask #4
65.0 / 65.0

# 결과 실행 시간 메모리 Grader output
1 Correct 8 ms 18900 KB Output is correct
2 Correct 8 ms 18900 KB Output is correct
3 Correct 9 ms 18900 KB Output is correct
4 Correct 9 ms 18832 KB Output is correct
5 Correct 12 ms 18936 KB Output is correct
6 Correct 9 ms 18928 KB Output is correct
7 Correct 9 ms 18936 KB Output is correct
8 Correct 10 ms 18900 KB Output is correct
9 Correct 9 ms 18800 KB Output is correct
10 Correct 8 ms 18900 KB Output is correct
11 Correct 8 ms 18900 KB Output is correct
12 Correct 9 ms 18900 KB Output is correct
13 Correct 8 ms 18900 KB Output is correct
14 Correct 8 ms 18928 KB Output is correct
15 Correct 9 ms 18900 KB Output is correct
16 Correct 9 ms 18900 KB Output is correct
17 Correct 9 ms 18900 KB Output is correct
18 Correct 11 ms 18900 KB Output is correct
19 Correct 8 ms 18900 KB Output is correct
20 Correct 8 ms 18900 KB Output is correct
21 Correct 9 ms 18900 KB Output is correct
22 Correct 8 ms 18936 KB Output is correct
23 Correct 8 ms 18900 KB Output is correct
24 Correct 8 ms 18900 KB Output is correct
25 Correct 76 ms 25440 KB Output is correct
26 Correct 20 ms 19784 KB Output is correct
27 Correct 105 ms 28108 KB Output is correct
28 Correct 105 ms 28212 KB Output is correct
29 Correct 84 ms 25436 KB Output is correct
30 Correct 75 ms 25200 KB Output is correct
31 Correct 94 ms 27116 KB Output is correct
32 Correct 105 ms 28236 KB Output is correct
33 Correct 102 ms 27556 KB Output is correct
34 Correct 56 ms 23428 KB Output is correct
35 Correct 105 ms 28108 KB Output is correct
36 Correct 109 ms 28236 KB Output is correct
37 Correct 64 ms 23800 KB Output is correct
38 Correct 103 ms 27304 KB Output is correct
39 Correct 28 ms 20232 KB Output is correct
40 Correct 104 ms 27256 KB Output is correct
41 Correct 78 ms 25036 KB Output is correct
42 Correct 122 ms 27240 KB Output is correct
43 Correct 48 ms 21748 KB Output is correct
44 Correct 106 ms 27256 KB Output is correct
45 Correct 26 ms 20476 KB Output is correct
46 Correct 140 ms 27324 KB Output is correct
47 Correct 37 ms 21284 KB Output is correct
48 Correct 105 ms 27248 KB Output is correct
49 Correct 245 ms 48172 KB Output is correct
50 Correct 275 ms 51584 KB Output is correct
51 Correct 161 ms 41788 KB Output is correct
52 Correct 249 ms 51444 KB Output is correct
53 Correct 92 ms 33712 KB Output is correct
54 Correct 251 ms 51580 KB Output is correct
55 Correct 200 ms 47096 KB Output is correct
56 Correct 289 ms 51572 KB Output is correct
57 Correct 35 ms 23884 KB Output is correct
58 Correct 253 ms 51560 KB Output is correct
59 Correct 159 ms 39308 KB Output is correct
60 Correct 243 ms 51528 KB Output is correct
61 Correct 165 ms 41612 KB Output is correct
62 Correct 147 ms 41252 KB Output is correct
63 Correct 145 ms 42004 KB Output is correct
64 Correct 164 ms 43572 KB Output is correct
65 Correct 164 ms 41984 KB Output is correct
66 Correct 158 ms 42788 KB Output is correct
67 Correct 170 ms 41264 KB Output is correct
68 Correct 186 ms 41436 KB Output is correct
69 Correct 146 ms 41352 KB Output is correct
70 Correct 152 ms 42116 KB Output is correct
71 Correct 167 ms 41280 KB Output is correct
72 Correct 146 ms 42052 KB Output is correct
73 Correct 394 ms 56856 KB Output is correct
74 Correct 286 ms 52528 KB Output is correct
75 Correct 379 ms 52832 KB Output is correct
76 Correct 482 ms 63140 KB Output is correct
77 Correct 215 ms 41716 KB Output is correct
78 Correct 438 ms 59476 KB Output is correct
79 Correct 421 ms 58476 KB Output is correct
80 Correct 496 ms 62924 KB Output is correct
81 Correct 164 ms 33544 KB Output is correct
82 Correct 360 ms 57420 KB Output is correct
83 Correct 307 ms 50152 KB Output is correct
84 Correct 479 ms 63012 KB Output is correct
85 Correct 268 ms 55056 KB Output is correct
86 Correct 362 ms 59252 KB Output is correct
87 Correct 177 ms 51268 KB Output is correct
88 Correct 349 ms 60272 KB Output is correct
89 Correct 310 ms 56664 KB Output is correct
90 Correct 335 ms 59440 KB Output is correct
91 Correct 228 ms 52516 KB Output is correct
92 Correct 372 ms 59260 KB Output is correct
93 Correct 188 ms 50904 KB Output is correct
94 Correct 334 ms 59404 KB Output is correct
95 Correct 205 ms 52000 KB Output is correct
96 Correct 415 ms 59900 KB Output is correct