oj.uz

Submission #579085

# Submission time Handle Problem Language Result Execution time Memory
579085 2022-06-18T11:19:40 Z Lucpp Two Antennas (JOI19_antennas) C++17
35 / 100
 388 ms 19848 KB 
#include <bits/stdc++.h>
using namespace std;
const int INF = 2e9;

struct Seg{
    vector<int> Smi, Sma;
    int cap;
    void init(int n){
        for(cap = 1; cap < n; cap *= 2);
        Smi.resize(2*cap, INF);
        Sma.resize(2*cap);
    }
    void upd(int i, int v){
        i += cap;
        if(v > 0) Smi[i] = Sma[i] = v;
        else Smi[i] = INF, Sma[i] = 0;
        while(i > 1){
            i /= 2;
            Smi[i] = min(Smi[2*i], Smi[2*i+1]);
            Sma[i] = max(Sma[2*i], Sma[2*i+1]);
        }
    }
    pair<int, int> qry(int l, int r, int a, int b, int i){
        if(l <= a && b <= r) return {Smi[i], Sma[i]};
        if(r < a || b < l) return {INF, 0};
        int m = (a+b)/2;
        auto [mi1, ma1] = qry(l, r, a, m, 2*i);
        auto [mi2, ma2] = qry(l, r, m+1, b, 2*i+1);
        return {min(mi1, mi2), max(ma1, ma2)};
    }
    pair<int, int> qry(int l, int r){return qry(l, r, 1, cap, 1);}
};

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    int n, q;
    cin >> n;
    vector<int> h(n), a(n), b(n);
    for(int i = 0; i < n; i++) cin >> h[i] >> a[i] >> b[i];

    vector<vector<int>> memo((n<=2000?n:1), vector<int>(n));
    for(int L = 0; L < (n<=2000?n:1); L++){
        Seg seg;
        seg.init(n);
        vector<vector<pair<int, int>>> todo(n);
        int ans = -1;
        for(int i = L; i < n; i++){
            for(auto [j, v] : todo[i]){
                seg.upd(j, v);
            }
            if(i+a[i]<n) todo[i+a[i]].emplace_back(i, h[i]);
            if(i+b[i]+1<n) todo[i+b[i]+1].emplace_back(i, 0);
            int l = max(0, i-b[i]);
            int r = max(-1, i-a[i]);
            if(r != -1){
                auto [mi, ma] = seg.qry(l+1, r+1);
                ans = max(ans, max(h[i]-mi, ma-h[i]));
            }
            memo[L][i] = ans;
        }
    }

    cin >> q;
    for(int i = 0; i < q; ++i){
        int l, r;
        cin >> l >> r;
        cout << memo[l-1][r-1] << "\n";
    }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 596 KB Output is correct
3 Correct 4 ms 456 KB Output is correct
4 Correct 6 ms 596 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 6 ms 596 KB Output is correct
7 Correct 5 ms 580 KB Output is correct
8 Correct 6 ms 596 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 6 ms 596 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 6 ms 596 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 3 ms 580 KB Output is correct
23 Correct 4 ms 596 KB Output is correct
24 Correct 4 ms 596 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 596 KB Output is correct
3 Correct 4 ms 456 KB Output is correct
4 Correct 6 ms 596 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 6 ms 596 KB Output is correct
7 Correct 5 ms 580 KB Output is correct
8 Correct 6 ms 596 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 6 ms 596 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 6 ms 596 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 3 ms 580 KB Output is correct
23 Correct 4 ms 596 KB Output is correct
24 Correct 4 ms 596 KB Output is correct
25 Correct 90 ms 5636 KB Output is correct
26 Correct 334 ms 16404 KB Output is correct
27 Correct 282 ms 14452 KB Output is correct
28 Correct 388 ms 19780 KB Output is correct
29 Correct 110 ms 6320 KB Output is correct
30 Correct 364 ms 18456 KB Output is correct
31 Correct 55 ms 3452 KB Output is correct
32 Correct 373 ms 19848 KB Output is correct
33 Correct 170 ms 9316 KB Output is correct
34 Correct 369 ms 17812 KB Output is correct
35 Correct 210 ms 12420 KB Output is correct
36 Correct 363 ms 19736 KB Output is correct
37 Correct 224 ms 16924 KB Output is correct
38 Correct 281 ms 17952 KB Output is correct
39 Correct 235 ms 15856 KB Output is correct
40 Correct 270 ms 17988 KB Output is correct
41 Correct 257 ms 17356 KB Output is correct
42 Correct 261 ms 17960 KB Output is correct
43 Correct 254 ms 16248 KB Output is correct
44 Correct 304 ms 18068 KB Output is correct
45 Correct 205 ms 15924 KB Output is correct
46 Correct 272 ms 17976 KB Output is correct
47 Correct 216 ms 15948 KB Output is correct
48 Correct 299 ms 18140 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 128 ms 14756 KB Output is correct
2 Correct 174 ms 15580 KB Output is correct
3 Correct 94 ms 12404 KB Output is correct
4 Correct 133 ms 15592 KB Output is correct
5 Correct 66 ms 7628 KB Output is correct
6 Correct 133 ms 15676 KB Output is correct
7 Correct 132 ms 14200 KB Output is correct
8 Correct 151 ms 15588 KB Output is correct
9 Correct 20 ms 2720 KB Output is correct
10 Correct 138 ms 15656 KB Output is correct
11 Correct 79 ms 9444 KB Output is correct
12 Correct 149 ms 15604 KB Output is correct
13 Correct 108 ms 14512 KB Output is correct
14 Correct 119 ms 14392 KB Output is correct
15 Correct 118 ms 14392 KB Output is correct
16 Correct 108 ms 14900 KB Output is correct
17 Correct 109 ms 15088 KB Output is correct
18 Correct 119 ms 14872 KB Output is correct
19 Correct 107 ms 14468 KB Output is correct
20 Correct 103 ms 14824 KB Output is correct
21 Correct 118 ms 14508 KB Output is correct
22 Correct 111 ms 14224 KB Output is correct
23 Correct 107 ms 14356 KB Output is correct
24 Correct 112 ms 14428 KB Output is correct

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 7 ms 596 KB Output is correct
3 Correct 4 ms 456 KB Output is correct
4 Correct 6 ms 596 KB Output is correct
5 Correct 4 ms 596 KB Output is correct
6 Correct 6 ms 596 KB Output is correct
7 Correct 5 ms 580 KB Output is correct
8 Correct 6 ms 596 KB Output is correct
9 Correct 2 ms 340 KB Output is correct
10 Correct 6 ms 596 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 6 ms 596 KB Output is correct
13 Correct 4 ms 596 KB Output is correct
14 Correct 3 ms 596 KB Output is correct
15 Correct 4 ms 596 KB Output is correct
16 Correct 4 ms 596 KB Output is correct
17 Correct 4 ms 596 KB Output is correct
18 Correct 4 ms 596 KB Output is correct
19 Correct 3 ms 596 KB Output is correct
20 Correct 4 ms 596 KB Output is correct
21 Correct 3 ms 604 KB Output is correct
22 Correct 3 ms 580 KB Output is correct
23 Correct 4 ms 596 KB Output is correct
24 Correct 4 ms 596 KB Output is correct
25 Correct 90 ms 5636 KB Output is correct
26 Correct 334 ms 16404 KB Output is correct
27 Correct 282 ms 14452 KB Output is correct
28 Correct 388 ms 19780 KB Output is correct
29 Correct 110 ms 6320 KB Output is correct
30 Correct 364 ms 18456 KB Output is correct
31 Correct 55 ms 3452 KB Output is correct
32 Correct 373 ms 19848 KB Output is correct
33 Correct 170 ms 9316 KB Output is correct
34 Correct 369 ms 17812 KB Output is correct
35 Correct 210 ms 12420 KB Output is correct
36 Correct 363 ms 19736 KB Output is correct
37 Correct 224 ms 16924 KB Output is correct
38 Correct 281 ms 17952 KB Output is correct
39 Correct 235 ms 15856 KB Output is correct
40 Correct 270 ms 17988 KB Output is correct
41 Correct 257 ms 17356 KB Output is correct
42 Correct 261 ms 17960 KB Output is correct
43 Correct 254 ms 16248 KB Output is correct
44 Correct 304 ms 18068 KB Output is correct
45 Correct 205 ms 15924 KB Output is correct
46 Correct 272 ms 17976 KB Output is correct
47 Correct 216 ms 15948 KB Output is correct
48 Correct 299 ms 18140 KB Output is correct
49 Correct 128 ms 14756 KB Output is correct
50 Correct 174 ms 15580 KB Output is correct
51 Correct 94 ms 12404 KB Output is correct
52 Correct 133 ms 15592 KB Output is correct
53 Correct 66 ms 7628 KB Output is correct
54 Correct 133 ms 15676 KB Output is correct
55 Correct 132 ms 14200 KB Output is correct
56 Correct 151 ms 15588 KB Output is correct
57 Correct 20 ms 2720 KB Output is correct
58 Correct 138 ms 15656 KB Output is correct
59 Correct 79 ms 9444 KB Output is correct
60 Correct 149 ms 15604 KB Output is correct
61 Correct 108 ms 14512 KB Output is correct
62 Correct 119 ms 14392 KB Output is correct
63 Correct 118 ms 14392 KB Output is correct
64 Correct 108 ms 14900 KB Output is correct
65 Correct 109 ms 15088 KB Output is correct
66 Correct 119 ms 14872 KB Output is correct
67 Correct 107 ms 14468 KB Output is correct
68 Correct 103 ms 14824 KB Output is correct
69 Correct 118 ms 14508 KB Output is correct
70 Correct 111 ms 14224 KB Output is correct
71 Correct 107 ms 14356 KB Output is correct
72 Correct 112 ms 14428 KB Output is correct
73 Runtime error 135 ms 18492 KB Execution killed with signal 11
74 Halted 0 ms 0 KB -