oj.uz

Submission #489551

# Submission time Handle Problem Language Result Execution time Memory
489551 2021-11-23T07:42:15 Z KienTran Two Antennas (JOI19_antennas) C++14
100 / 100
 776 ms 117452 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int O = 1e6 + 5;
const int inf = 1e18;

int n, q, l[O], r[O], h[O], a[O], b[O], res[O], tree[O * 4], Min[O * 4], Max[O * 4];
vector <int> qu[O], in[O], out[O];

int Beauti(int x){
    return max(1ll, x);
}

void Push(int id){
    int &x = Min[id];
    if (x == inf) return;

    for (int i = 2 * id; i <= 2 * id + 1; ++ i){
        tree[i] = max(tree[i], Max[i] - x);
        Min[i] = min(Min[i], x);
    }

    x = inf; return;
}

void UpdateMax(int id, int l, int r, int u, int x){
    if (l > u || r < u) return;
    if (l == r){
        Max[id] = x;
        Min[id] = inf;
        tree[id] = max(tree[id], Max[id] - Min[id]);
        return;
    }
    int mid = (l + r) / 2; Push(id);
    UpdateMax(id << 1, l, mid, u, x);
    UpdateMax(id << 1 | 1, mid + 1, r, u, x);
    tree[id] = max({tree[id], tree[id << 1], tree[id << 1 | 1]});
    Max[id] = max(Max[id << 1], Max[id << 1 | 1]);
}

void UpdateMin(int id, int l, int r, int u, int v, int x){
    if (l > v || r < u) return;
    if (u <= l && r <= v){
        Min[id] = min(Min[id], x);
        tree[id] = max(tree[id], Max[id] - Min[id]);
        return;
    }
    int mid = (l + r) / 2; Push(id);
    UpdateMin(id << 1, l, mid, u, v, x);
    UpdateMin(id << 1 | 1, mid + 1, r, u, v, x);
    tree[id] = max({tree[id], tree[id << 1], tree[id << 1 | 1], Max[id] - Min[id]});
}

int Get(int id, int l, int r, int u, int v){
    if (l > v || r < u) return -inf;
    if (u <= l && r <= v) return tree[id];
    int mid = (l + r) / 2; Push(id);
    return max(Get(id << 1, l, mid, u, v), Get(id << 1 | 1, mid + 1, r, u, v));
}

void solve(){
    for (int i = 1; i <= q; ++ i) qu[r[i]].push_back(i);

    for (int i = 1; i < O; ++ i){
        tree[i] = -inf;
        Max[i] = -inf;
        Min[i] = inf;
    }

    for (int i = 1; i <= n; ++ i){
        for (int j : in[i]){
            UpdateMax(1, 1, n, j, h[j]);
        }

        for (int j : out[i]){
            UpdateMax(1, 1, n, j, -inf);
        }

        if (i - a[i] >= 1) UpdateMin(1, 1, n, Beauti(i - b[i]), Beauti(i - a[i]), h[i]);

        for (int j : qu[i]){
            res[j] = max(res[j], Get(1, 1, n, l[j], i));
        }

        if (i + a[i] <= n) in[i + a[i]].push_back(i);
        if (i + b[i] + 1 <= n) out[i + b[i] + 1].push_back(i);
    }

    for (int i = 1; i <= n; ++ i){
        qu[i].clear();
        in[i].clear();
        out[i].clear();
    }

}

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

    cin >> q;
    for (int i = 1; i <= q; ++ i){
        cin >> l[i] >> r[i];
        res[i] = -1;
    }

    solve();

    reverse(h + 1, h + n + 1);
    reverse(a + 1, a + n + 1);
    reverse(b + 1, b + n + 1);

    for (int i = 1; i <= q; ++ i){
        l[i] = n - l[i] + 1;
        r[i] = n - r[i] + 1;
        swap(l[i], r[i]);
    }

    solve();

    for (int i = 1; i <= q; ++ i) cout << res[i] << "\n";
}

Compilation message

antennas.cpp:99:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   99 | main(){
      | ^~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 94280 KB Output is correct
2 Correct 45 ms 94352 KB Output is correct
3 Correct 45 ms 94316 KB Output is correct
4 Correct 60 ms 94308 KB Output is correct
5 Correct 48 ms 94328 KB Output is correct
6 Correct 47 ms 94332 KB Output is correct
7 Correct 53 ms 94300 KB Output is correct
8 Correct 48 ms 94244 KB Output is correct
9 Correct 48 ms 94312 KB Output is correct
10 Correct 47 ms 94368 KB Output is correct
11 Correct 46 ms 94304 KB Output is correct
12 Correct 46 ms 94264 KB Output is correct
13 Correct 50 ms 94244 KB Output is correct
14 Correct 48 ms 94264 KB Output is correct
15 Correct 50 ms 94284 KB Output is correct
16 Correct 47 ms 94276 KB Output is correct
17 Correct 46 ms 94256 KB Output is correct
18 Correct 47 ms 94248 KB Output is correct
19 Correct 49 ms 94276 KB Output is correct
20 Correct 47 ms 94328 KB Output is correct
21 Correct 47 ms 94276 KB Output is correct
22 Correct 47 ms 94284 KB Output is correct
23 Correct 48 ms 94328 KB Output is correct
24 Correct 53 ms 94312 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 94280 KB Output is correct
2 Correct 45 ms 94352 KB Output is correct
3 Correct 45 ms 94316 KB Output is correct
4 Correct 60 ms 94308 KB Output is correct
5 Correct 48 ms 94328 KB Output is correct
6 Correct 47 ms 94332 KB Output is correct
7 Correct 53 ms 94300 KB Output is correct
8 Correct 48 ms 94244 KB Output is correct
9 Correct 48 ms 94312 KB Output is correct
10 Correct 47 ms 94368 KB Output is correct
11 Correct 46 ms 94304 KB Output is correct
12 Correct 46 ms 94264 KB Output is correct
13 Correct 50 ms 94244 KB Output is correct
14 Correct 48 ms 94264 KB Output is correct
15 Correct 50 ms 94284 KB Output is correct
16 Correct 47 ms 94276 KB Output is correct
17 Correct 46 ms 94256 KB Output is correct
18 Correct 47 ms 94248 KB Output is correct
19 Correct 49 ms 94276 KB Output is correct
20 Correct 47 ms 94328 KB Output is correct
21 Correct 47 ms 94276 KB Output is correct
22 Correct 47 ms 94284 KB Output is correct
23 Correct 48 ms 94328 KB Output is correct
24 Correct 53 ms 94312 KB Output is correct
25 Correct 136 ms 101468 KB Output is correct
26 Correct 59 ms 95096 KB Output is correct
27 Correct 179 ms 104100 KB Output is correct
28 Correct 187 ms 103892 KB Output is correct
29 Correct 133 ms 101700 KB Output is correct
30 Correct 132 ms 100888 KB Output is correct
31 Correct 145 ms 103484 KB Output is correct
32 Correct 174 ms 103856 KB Output is correct
33 Correct 160 ms 103880 KB Output is correct
34 Correct 112 ms 99164 KB Output is correct
35 Correct 176 ms 104376 KB Output is correct
36 Correct 175 ms 103980 KB Output is correct
37 Correct 119 ms 99376 KB Output is correct
38 Correct 169 ms 103000 KB Output is correct
39 Correct 73 ms 95640 KB Output is correct
40 Correct 172 ms 102980 KB Output is correct
41 Correct 137 ms 101012 KB Output is correct
42 Correct 177 ms 102944 KB Output is correct
43 Correct 88 ms 97352 KB Output is correct
44 Correct 178 ms 102980 KB Output is correct
45 Correct 69 ms 95812 KB Output is correct
46 Correct 173 ms 102992 KB Output is correct
47 Correct 80 ms 96524 KB Output is correct
48 Correct 175 ms 102976 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 391 ms 103776 KB Output is correct
2 Correct 420 ms 104692 KB Output is correct
3 Correct 322 ms 101564 KB Output is correct
4 Correct 407 ms 104740 KB Output is correct
5 Correct 197 ms 99140 KB Output is correct
6 Correct 415 ms 104700 KB Output is correct
7 Correct 378 ms 103304 KB Output is correct
8 Correct 408 ms 104760 KB Output is correct
9 Correct 83 ms 95924 KB Output is correct
10 Correct 437 ms 104804 KB Output is correct
11 Correct 242 ms 100860 KB Output is correct
12 Correct 409 ms 104816 KB Output is correct
13 Correct 245 ms 103972 KB Output is correct
14 Correct 233 ms 103728 KB Output is correct
15 Correct 236 ms 102864 KB Output is correct
16 Correct 213 ms 102728 KB Output is correct
17 Correct 249 ms 104368 KB Output is correct
18 Correct 232 ms 103376 KB Output is correct
19 Correct 237 ms 103536 KB Output is correct
20 Correct 244 ms 103676 KB Output is correct
21 Correct 229 ms 103588 KB Output is correct
22 Correct 236 ms 103544 KB Output is correct
23 Correct 233 ms 103752 KB Output is correct
24 Correct 210 ms 102264 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 94280 KB Output is correct
2 Correct 45 ms 94352 KB Output is correct
3 Correct 45 ms 94316 KB Output is correct
4 Correct 60 ms 94308 KB Output is correct
5 Correct 48 ms 94328 KB Output is correct
6 Correct 47 ms 94332 KB Output is correct
7 Correct 53 ms 94300 KB Output is correct
8 Correct 48 ms 94244 KB Output is correct
9 Correct 48 ms 94312 KB Output is correct
10 Correct 47 ms 94368 KB Output is correct
11 Correct 46 ms 94304 KB Output is correct
12 Correct 46 ms 94264 KB Output is correct
13 Correct 50 ms 94244 KB Output is correct
14 Correct 48 ms 94264 KB Output is correct
15 Correct 50 ms 94284 KB Output is correct
16 Correct 47 ms 94276 KB Output is correct
17 Correct 46 ms 94256 KB Output is correct
18 Correct 47 ms 94248 KB Output is correct
19 Correct 49 ms 94276 KB Output is correct
20 Correct 47 ms 94328 KB Output is correct
21 Correct 47 ms 94276 KB Output is correct
22 Correct 47 ms 94284 KB Output is correct
23 Correct 48 ms 94328 KB Output is correct
24 Correct 53 ms 94312 KB Output is correct
25 Correct 136 ms 101468 KB Output is correct
26 Correct 59 ms 95096 KB Output is correct
27 Correct 179 ms 104100 KB Output is correct
28 Correct 187 ms 103892 KB Output is correct
29 Correct 133 ms 101700 KB Output is correct
30 Correct 132 ms 100888 KB Output is correct
31 Correct 145 ms 103484 KB Output is correct
32 Correct 174 ms 103856 KB Output is correct
33 Correct 160 ms 103880 KB Output is correct
34 Correct 112 ms 99164 KB Output is correct
35 Correct 176 ms 104376 KB Output is correct
36 Correct 175 ms 103980 KB Output is correct
37 Correct 119 ms 99376 KB Output is correct
38 Correct 169 ms 103000 KB Output is correct
39 Correct 73 ms 95640 KB Output is correct
40 Correct 172 ms 102980 KB Output is correct
41 Correct 137 ms 101012 KB Output is correct
42 Correct 177 ms 102944 KB Output is correct
43 Correct 88 ms 97352 KB Output is correct
44 Correct 178 ms 102980 KB Output is correct
45 Correct 69 ms 95812 KB Output is correct
46 Correct 173 ms 102992 KB Output is correct
47 Correct 80 ms 96524 KB Output is correct
48 Correct 175 ms 102976 KB Output is correct
49 Correct 391 ms 103776 KB Output is correct
50 Correct 420 ms 104692 KB Output is correct
51 Correct 322 ms 101564 KB Output is correct
52 Correct 407 ms 104740 KB Output is correct
53 Correct 197 ms 99140 KB Output is correct
54 Correct 415 ms 104700 KB Output is correct
55 Correct 378 ms 103304 KB Output is correct
56 Correct 408 ms 104760 KB Output is correct
57 Correct 83 ms 95924 KB Output is correct
58 Correct 437 ms 104804 KB Output is correct
59 Correct 242 ms 100860 KB Output is correct
60 Correct 409 ms 104816 KB Output is correct
61 Correct 245 ms 103972 KB Output is correct
62 Correct 233 ms 103728 KB Output is correct
63 Correct 236 ms 102864 KB Output is correct
64 Correct 213 ms 102728 KB Output is correct
65 Correct 249 ms 104368 KB Output is correct
66 Correct 232 ms 103376 KB Output is correct
67 Correct 237 ms 103536 KB Output is correct
68 Correct 244 ms 103676 KB Output is correct
69 Correct 229 ms 103588 KB Output is correct
70 Correct 236 ms 103544 KB Output is correct
71 Correct 233 ms 103752 KB Output is correct
72 Correct 210 ms 102264 KB Output is correct
73 Correct 617 ms 113440 KB Output is correct
74 Correct 446 ms 106100 KB Output is correct
75 Correct 585 ms 113480 KB Output is correct
76 Correct 738 ms 117452 KB Output is correct
77 Correct 413 ms 107644 KB Output is correct
78 Correct 641 ms 113972 KB Output is correct
79 Correct 686 ms 115780 KB Output is correct
80 Correct 776 ms 117308 KB Output is correct
81 Correct 279 ms 105828 KB Output is correct
82 Correct 644 ms 111740 KB Output is correct
83 Correct 546 ms 112356 KB Output is correct
84 Correct 764 ms 117296 KB Output is correct
85 Correct 445 ms 111420 KB Output is correct
86 Correct 565 ms 115140 KB Output is correct
87 Correct 275 ms 105044 KB Output is correct
88 Correct 554 ms 114340 KB Output is correct
89 Correct 484 ms 113428 KB Output is correct
90 Correct 560 ms 114792 KB Output is correct
91 Correct 354 ms 108216 KB Output is correct
92 Correct 590 ms 115144 KB Output is correct
93 Correct 300 ms 106308 KB Output is correct
94 Correct 559 ms 114976 KB Output is correct
95 Correct 332 ms 107508 KB Output is correct
96 Correct 527 ms 113752 KB Output is correct