oj.uz

Submission #583132

# Submission time Handle Problem Language Result Execution time Memory
583132 2022-06-24T21:37:16 Z Lucpp Two Antennas (JOI19_antennas) C++17
100 / 100
 947 ms 35456 KB 
#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9+1;
const int MAX = 2e5;
const int cap = 1<<18;

struct Data{
    int val = -INF, hmin = INF;
};
Data combine(Data a, Data b){
    return {max(a.val, b.val), min(a.hmin, b.hmin)};
}

Data S[2*cap];
int O[2*cap];
bool lazy[2*cap];

void init(){
    memset(lazy, 0, sizeof(lazy));
    fill_n(O, 2*cap, -INF);
    fill_n(S, 2*cap, Data());
}
void apply(int i, int u){
    S[i].val = max(S[i].val, u-S[i].hmin);
    O[i] = max(O[i], u);
    lazy[i] = true;
}
void push(int i){
    if(lazy[i]){
        apply(2*i, O[i]);
        apply(2*i+1, O[i]);
        O[i] = -INF;
        lazy[i] = false;
    }
}
void update(int l, int r, int u, int a = 1, int b = cap, int i = 1){
    if(l <= a && b <= r) apply(i, u);
    else if(b < l || r < a);
    else{
        push(i);
        int m = (a+b)/2;
        update(l, r, u, a, m, 2*i);
        update(l, r, u, m+1, b, 2*i+1);
        S[i] = combine(S[2*i], S[2*i+1]);
    }
}
void updH(int p, int h, int a = 1, int b = cap, int i = 1){
    if(a == b){
        S[i].hmin = h;
        return;
    }
    push(i);
    int m = (a+b)/2;
    if(p <= m) updH(p, h, a, m, 2*i);
    else updH(p, h, m+1, b, 2*i+1);
    S[i] = combine(S[2*i], S[2*i+1]);
}
Data qry(int l, int r, int a = 1, int b = cap, int i = 1){
    if(l <= a && b <= r) return S[i];
    if(b < l || r < a) return Data();
    push(i);
    int m = (a+b)/2;
    return combine(qry(l, r, a, m, 2*i), qry(l, r, m+1, b, 2*i+1));
}


int N, Q;
int A[MAX], B[MAX], H[MAX], ans[MAX];
vector<pair<int, int>> todo[MAX], queries[MAX];

void solve(){
    init();
    for(int R = 0; R < N; R++){
        for(auto [i, op] : todo[R]) {
            if(op == 1) updH(i+1, H[i]);
            else updH(i+1, INF);
        }
        if(R-A[R] >= 0){
            int l = max(0, R-B[R]), r = R-A[R];
            update(l+1, r+1, H[R]);
        }
        for(auto [L, ind] : queries[R]){
            ans[ind] = max(ans[ind], qry(L+1, R+1).val);
        }
    }
}

int main(){
    cin >> N;
    for(int i = 0; i < N; i++){
        cin >> H[i] >> A[i] >> B[i];
        if(i+A[i] < N) todo[i+A[i]].emplace_back(i, 1);
        if(i+B[i]+1 < N) todo[i+B[i]+1].emplace_back(i, -1);
    }
    cin >> Q;
    fill_n(ans, Q, -1);
    for(int i = 0; i < Q; i++){
        int L, R;
        cin >> L >> R;
        L--; R--;
        queries[R].emplace_back(L, i);
    }
    solve();
    for(int i = 0; i < N; i++) H[i] = -H[i];
    solve();
    for(int i = 0; i < Q; i++) cout << ans[i] << "\n";
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16340 KB Output is correct
2 Correct 10 ms 16340 KB Output is correct
3 Correct 10 ms 16372 KB Output is correct
4 Correct 11 ms 16324 KB Output is correct
5 Correct 13 ms 16412 KB Output is correct
6 Correct 13 ms 16408 KB Output is correct
7 Correct 12 ms 16340 KB Output is correct
8 Correct 11 ms 16372 KB Output is correct
9 Correct 10 ms 16372 KB Output is correct
10 Correct 11 ms 16436 KB Output is correct
11 Correct 12 ms 16340 KB Output is correct
12 Correct 11 ms 16372 KB Output is correct
13 Correct 11 ms 16340 KB Output is correct
14 Correct 10 ms 16340 KB Output is correct
15 Correct 11 ms 16404 KB Output is correct
16 Correct 11 ms 16340 KB Output is correct
17 Correct 13 ms 16372 KB Output is correct
18 Correct 14 ms 16376 KB Output is correct
19 Correct 11 ms 16340 KB Output is correct
20 Correct 11 ms 16372 KB Output is correct
21 Correct 11 ms 16368 KB Output is correct
22 Correct 12 ms 16340 KB Output is correct
23 Correct 10 ms 16340 KB Output is correct
24 Correct 11 ms 16388 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16340 KB Output is correct
2 Correct 10 ms 16340 KB Output is correct
3 Correct 10 ms 16372 KB Output is correct
4 Correct 11 ms 16324 KB Output is correct
5 Correct 13 ms 16412 KB Output is correct
6 Correct 13 ms 16408 KB Output is correct
7 Correct 12 ms 16340 KB Output is correct
8 Correct 11 ms 16372 KB Output is correct
9 Correct 10 ms 16372 KB Output is correct
10 Correct 11 ms 16436 KB Output is correct
11 Correct 12 ms 16340 KB Output is correct
12 Correct 11 ms 16372 KB Output is correct
13 Correct 11 ms 16340 KB Output is correct
14 Correct 10 ms 16340 KB Output is correct
15 Correct 11 ms 16404 KB Output is correct
16 Correct 11 ms 16340 KB Output is correct
17 Correct 13 ms 16372 KB Output is correct
18 Correct 14 ms 16376 KB Output is correct
19 Correct 11 ms 16340 KB Output is correct
20 Correct 11 ms 16372 KB Output is correct
21 Correct 11 ms 16368 KB Output is correct
22 Correct 12 ms 16340 KB Output is correct
23 Correct 10 ms 16340 KB Output is correct
24 Correct 11 ms 16388 KB Output is correct
25 Correct 172 ms 21140 KB Output is correct
26 Correct 32 ms 16972 KB Output is correct
27 Correct 235 ms 23252 KB Output is correct
28 Correct 286 ms 23244 KB Output is correct
29 Correct 168 ms 21124 KB Output is correct
30 Correct 170 ms 20860 KB Output is correct
31 Correct 212 ms 22316 KB Output is correct
32 Correct 248 ms 23232 KB Output is correct
33 Correct 255 ms 22892 KB Output is correct
34 Correct 133 ms 19640 KB Output is correct
35 Correct 245 ms 23104 KB Output is correct
36 Correct 239 ms 23188 KB Output is correct
37 Correct 158 ms 19724 KB Output is correct
38 Correct 244 ms 22304 KB Output is correct
39 Correct 45 ms 17356 KB Output is correct
40 Correct 248 ms 22404 KB Output is correct
41 Correct 192 ms 20656 KB Output is correct
42 Correct 268 ms 22288 KB Output is correct
43 Correct 87 ms 18440 KB Output is correct
44 Correct 235 ms 22300 KB Output is correct
45 Correct 54 ms 17356 KB Output is correct
46 Correct 237 ms 22312 KB Output is correct
47 Correct 73 ms 17864 KB Output is correct
48 Correct 305 ms 22336 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 381 ms 25492 KB Output is correct
2 Correct 496 ms 26408 KB Output is correct
3 Correct 341 ms 23428 KB Output is correct
4 Correct 436 ms 26388 KB Output is correct
5 Correct 227 ms 20948 KB Output is correct
6 Correct 419 ms 26372 KB Output is correct
7 Correct 407 ms 25056 KB Output is correct
8 Correct 530 ms 26388 KB Output is correct
9 Correct 69 ms 17868 KB Output is correct
10 Correct 495 ms 26392 KB Output is correct
11 Correct 269 ms 22564 KB Output is correct
12 Correct 482 ms 26388 KB Output is correct
13 Correct 338 ms 24836 KB Output is correct
14 Correct 338 ms 24900 KB Output is correct
15 Correct 306 ms 25108 KB Output is correct
16 Correct 317 ms 25720 KB Output is correct
17 Correct 342 ms 25188 KB Output is correct
18 Correct 337 ms 25580 KB Output is correct
19 Correct 320 ms 24976 KB Output is correct
20 Correct 384 ms 24928 KB Output is correct
21 Correct 318 ms 24316 KB Output is correct
22 Correct 320 ms 24748 KB Output is correct
23 Correct 315 ms 24860 KB Output is correct
24 Correct 355 ms 25096 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 16340 KB Output is correct
2 Correct 10 ms 16340 KB Output is correct
3 Correct 10 ms 16372 KB Output is correct
4 Correct 11 ms 16324 KB Output is correct
5 Correct 13 ms 16412 KB Output is correct
6 Correct 13 ms 16408 KB Output is correct
7 Correct 12 ms 16340 KB Output is correct
8 Correct 11 ms 16372 KB Output is correct
9 Correct 10 ms 16372 KB Output is correct
10 Correct 11 ms 16436 KB Output is correct
11 Correct 12 ms 16340 KB Output is correct
12 Correct 11 ms 16372 KB Output is correct
13 Correct 11 ms 16340 KB Output is correct
14 Correct 10 ms 16340 KB Output is correct
15 Correct 11 ms 16404 KB Output is correct
16 Correct 11 ms 16340 KB Output is correct
17 Correct 13 ms 16372 KB Output is correct
18 Correct 14 ms 16376 KB Output is correct
19 Correct 11 ms 16340 KB Output is correct
20 Correct 11 ms 16372 KB Output is correct
21 Correct 11 ms 16368 KB Output is correct
22 Correct 12 ms 16340 KB Output is correct
23 Correct 10 ms 16340 KB Output is correct
24 Correct 11 ms 16388 KB Output is correct
25 Correct 172 ms 21140 KB Output is correct
26 Correct 32 ms 16972 KB Output is correct
27 Correct 235 ms 23252 KB Output is correct
28 Correct 286 ms 23244 KB Output is correct
29 Correct 168 ms 21124 KB Output is correct
30 Correct 170 ms 20860 KB Output is correct
31 Correct 212 ms 22316 KB Output is correct
32 Correct 248 ms 23232 KB Output is correct
33 Correct 255 ms 22892 KB Output is correct
34 Correct 133 ms 19640 KB Output is correct
35 Correct 245 ms 23104 KB Output is correct
36 Correct 239 ms 23188 KB Output is correct
37 Correct 158 ms 19724 KB Output is correct
38 Correct 244 ms 22304 KB Output is correct
39 Correct 45 ms 17356 KB Output is correct
40 Correct 248 ms 22404 KB Output is correct
41 Correct 192 ms 20656 KB Output is correct
42 Correct 268 ms 22288 KB Output is correct
43 Correct 87 ms 18440 KB Output is correct
44 Correct 235 ms 22300 KB Output is correct
45 Correct 54 ms 17356 KB Output is correct
46 Correct 237 ms 22312 KB Output is correct
47 Correct 73 ms 17864 KB Output is correct
48 Correct 305 ms 22336 KB Output is correct
49 Correct 381 ms 25492 KB Output is correct
50 Correct 496 ms 26408 KB Output is correct
51 Correct 341 ms 23428 KB Output is correct
52 Correct 436 ms 26388 KB Output is correct
53 Correct 227 ms 20948 KB Output is correct
54 Correct 419 ms 26372 KB Output is correct
55 Correct 407 ms 25056 KB Output is correct
56 Correct 530 ms 26388 KB Output is correct
57 Correct 69 ms 17868 KB Output is correct
58 Correct 495 ms 26392 KB Output is correct
59 Correct 269 ms 22564 KB Output is correct
60 Correct 482 ms 26388 KB Output is correct
61 Correct 338 ms 24836 KB Output is correct
62 Correct 338 ms 24900 KB Output is correct
63 Correct 306 ms 25108 KB Output is correct
64 Correct 317 ms 25720 KB Output is correct
65 Correct 342 ms 25188 KB Output is correct
66 Correct 337 ms 25580 KB Output is correct
67 Correct 320 ms 24976 KB Output is correct
68 Correct 384 ms 24928 KB Output is correct
69 Correct 318 ms 24316 KB Output is correct
70 Correct 320 ms 24748 KB Output is correct
71 Correct 315 ms 24860 KB Output is correct
72 Correct 355 ms 25096 KB Output is correct
73 Correct 741 ms 32204 KB Output is correct
74 Correct 568 ms 27196 KB Output is correct
75 Correct 709 ms 31968 KB Output is correct
76 Correct 840 ms 35436 KB Output is correct
77 Correct 513 ms 27140 KB Output is correct
78 Correct 766 ms 32672 KB Output is correct
79 Correct 827 ms 33928 KB Output is correct
80 Correct 894 ms 35456 KB Output is correct
81 Correct 377 ms 25284 KB Output is correct
82 Correct 682 ms 31032 KB Output is correct
83 Correct 707 ms 31056 KB Output is correct
84 Correct 947 ms 35404 KB Output is correct
85 Correct 628 ms 29804 KB Output is correct
86 Correct 724 ms 32844 KB Output is correct
87 Correct 370 ms 26316 KB Output is correct
88 Correct 688 ms 33512 KB Output is correct
89 Correct 581 ms 31140 KB Output is correct
90 Correct 736 ms 33452 KB Output is correct
91 Correct 440 ms 27904 KB Output is correct
92 Correct 676 ms 32788 KB Output is correct
93 Correct 391 ms 25952 KB Output is correct
94 Correct 698 ms 32768 KB Output is correct
95 Correct 422 ms 27204 KB Output is correct
96 Correct 698 ms 33140 KB Output is correct