oj.uz

Submission #489549

# Submission time Handle Problem Language Result Execution time Memory
489549 2021-11-23T07:39:27 Z KienTran Two Antennas (JOI19_antennas) C++14
35 / 100
 606 ms 65936 KB 
#include <bits/stdc++.h>
#define int long long

using namespace std;

const int O = 4e5 + 5;
const int inf = 1e16;

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){
        Min[i] = min(Min[i], x);
        tree[i] = max(tree[i], Max[i] - Min[i]);
    }

    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] - Min[id]});
    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]});
    Max[id] = max(Max[id << 1], Max[id << 1 | 1]);
}

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:100:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
  100 | main(){
      | ^~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 37964 KB Output is correct
2 Correct 20 ms 37980 KB Output is correct
3 Correct 21 ms 37964 KB Output is correct
4 Correct 22 ms 37964 KB Output is correct
5 Correct 24 ms 37892 KB Output is correct
6 Correct 21 ms 37888 KB Output is correct
7 Correct 20 ms 37956 KB Output is correct
8 Correct 21 ms 37956 KB Output is correct
9 Correct 20 ms 37988 KB Output is correct
10 Correct 22 ms 37888 KB Output is correct
11 Correct 21 ms 37872 KB Output is correct
12 Correct 24 ms 38000 KB Output is correct
13 Correct 22 ms 37964 KB Output is correct
14 Correct 20 ms 37964 KB Output is correct
15 Correct 23 ms 37964 KB Output is correct
16 Correct 21 ms 37908 KB Output is correct
17 Correct 21 ms 37884 KB Output is correct
18 Correct 26 ms 38052 KB Output is correct
19 Correct 20 ms 37964 KB Output is correct
20 Correct 20 ms 37932 KB Output is correct
21 Correct 21 ms 37996 KB Output is correct
22 Correct 21 ms 37972 KB Output is correct
23 Correct 20 ms 37964 KB Output is correct
24 Correct 20 ms 38000 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 37964 KB Output is correct
2 Correct 20 ms 37980 KB Output is correct
3 Correct 21 ms 37964 KB Output is correct
4 Correct 22 ms 37964 KB Output is correct
5 Correct 24 ms 37892 KB Output is correct
6 Correct 21 ms 37888 KB Output is correct
7 Correct 20 ms 37956 KB Output is correct
8 Correct 21 ms 37956 KB Output is correct
9 Correct 20 ms 37988 KB Output is correct
10 Correct 22 ms 37888 KB Output is correct
11 Correct 21 ms 37872 KB Output is correct
12 Correct 24 ms 38000 KB Output is correct
13 Correct 22 ms 37964 KB Output is correct
14 Correct 20 ms 37964 KB Output is correct
15 Correct 23 ms 37964 KB Output is correct
16 Correct 21 ms 37908 KB Output is correct
17 Correct 21 ms 37884 KB Output is correct
18 Correct 26 ms 38052 KB Output is correct
19 Correct 20 ms 37964 KB Output is correct
20 Correct 20 ms 37932 KB Output is correct
21 Correct 21 ms 37996 KB Output is correct
22 Correct 21 ms 37972 KB Output is correct
23 Correct 20 ms 37964 KB Output is correct
24 Correct 20 ms 38000 KB Output is correct
25 Correct 101 ms 45124 KB Output is correct
26 Correct 40 ms 38712 KB Output is correct
27 Correct 144 ms 47800 KB Output is correct
28 Correct 145 ms 47632 KB Output is correct
29 Correct 102 ms 45252 KB Output is correct
30 Correct 112 ms 44584 KB Output is correct
31 Correct 122 ms 47132 KB Output is correct
32 Correct 152 ms 47508 KB Output is correct
33 Correct 131 ms 47428 KB Output is correct
34 Correct 81 ms 42580 KB Output is correct
35 Correct 142 ms 48024 KB Output is correct
36 Correct 150 ms 47628 KB Output is correct
37 Correct 91 ms 43076 KB Output is correct
38 Correct 158 ms 46632 KB Output is correct
39 Correct 41 ms 39184 KB Output is correct
40 Correct 154 ms 46724 KB Output is correct
41 Correct 111 ms 44516 KB Output is correct
42 Correct 144 ms 46596 KB Output is correct
43 Correct 64 ms 40916 KB Output is correct
44 Correct 144 ms 46612 KB Output is correct
45 Correct 43 ms 39492 KB Output is correct
46 Correct 147 ms 46608 KB Output is correct
47 Correct 51 ms 40192 KB Output is correct
48 Correct 143 ms 46532 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 404 ms 50260 KB Output is correct
2 Correct 409 ms 51264 KB Output is correct
3 Correct 256 ms 48072 KB Output is correct
4 Correct 411 ms 51312 KB Output is correct
5 Correct 201 ms 44748 KB Output is correct
6 Correct 427 ms 55864 KB Output is correct
7 Correct 338 ms 53880 KB Output is correct
8 Correct 456 ms 55968 KB Output is correct
9 Correct 79 ms 40196 KB Output is correct
10 Correct 431 ms 55828 KB Output is correct
11 Correct 237 ms 47156 KB Output is correct
12 Correct 390 ms 55840 KB Output is correct
13 Correct 226 ms 53288 KB Output is correct
14 Correct 210 ms 52692 KB Output is correct
15 Correct 213 ms 51156 KB Output is correct
16 Correct 205 ms 51300 KB Output is correct
17 Correct 236 ms 53864 KB Output is correct
18 Correct 214 ms 52376 KB Output is correct
19 Correct 229 ms 52236 KB Output is correct
20 Correct 215 ms 52228 KB Output is correct
21 Correct 201 ms 52728 KB Output is correct
22 Correct 220 ms 52496 KB Output is correct
23 Correct 215 ms 52640 KB Output is correct
24 Correct 191 ms 50308 KB Output is correct

Subtask #4
0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 20 ms 37964 KB Output is correct
2 Correct 20 ms 37980 KB Output is correct
3 Correct 21 ms 37964 KB Output is correct
4 Correct 22 ms 37964 KB Output is correct
5 Correct 24 ms 37892 KB Output is correct
6 Correct 21 ms 37888 KB Output is correct
7 Correct 20 ms 37956 KB Output is correct
8 Correct 21 ms 37956 KB Output is correct
9 Correct 20 ms 37988 KB Output is correct
10 Correct 22 ms 37888 KB Output is correct
11 Correct 21 ms 37872 KB Output is correct
12 Correct 24 ms 38000 KB Output is correct
13 Correct 22 ms 37964 KB Output is correct
14 Correct 20 ms 37964 KB Output is correct
15 Correct 23 ms 37964 KB Output is correct
16 Correct 21 ms 37908 KB Output is correct
17 Correct 21 ms 37884 KB Output is correct
18 Correct 26 ms 38052 KB Output is correct
19 Correct 20 ms 37964 KB Output is correct
20 Correct 20 ms 37932 KB Output is correct
21 Correct 21 ms 37996 KB Output is correct
22 Correct 21 ms 37972 KB Output is correct
23 Correct 20 ms 37964 KB Output is correct
24 Correct 20 ms 38000 KB Output is correct
25 Correct 101 ms 45124 KB Output is correct
26 Correct 40 ms 38712 KB Output is correct
27 Correct 144 ms 47800 KB Output is correct
28 Correct 145 ms 47632 KB Output is correct
29 Correct 102 ms 45252 KB Output is correct
30 Correct 112 ms 44584 KB Output is correct
31 Correct 122 ms 47132 KB Output is correct
32 Correct 152 ms 47508 KB Output is correct
33 Correct 131 ms 47428 KB Output is correct
34 Correct 81 ms 42580 KB Output is correct
35 Correct 142 ms 48024 KB Output is correct
36 Correct 150 ms 47628 KB Output is correct
37 Correct 91 ms 43076 KB Output is correct
38 Correct 158 ms 46632 KB Output is correct
39 Correct 41 ms 39184 KB Output is correct
40 Correct 154 ms 46724 KB Output is correct
41 Correct 111 ms 44516 KB Output is correct
42 Correct 144 ms 46596 KB Output is correct
43 Correct 64 ms 40916 KB Output is correct
44 Correct 144 ms 46612 KB Output is correct
45 Correct 43 ms 39492 KB Output is correct
46 Correct 147 ms 46608 KB Output is correct
47 Correct 51 ms 40192 KB Output is correct
48 Correct 143 ms 46532 KB Output is correct
49 Correct 404 ms 50260 KB Output is correct
50 Correct 409 ms 51264 KB Output is correct
51 Correct 256 ms 48072 KB Output is correct
52 Correct 411 ms 51312 KB Output is correct
53 Correct 201 ms 44748 KB Output is correct
54 Correct 427 ms 55864 KB Output is correct
55 Correct 338 ms 53880 KB Output is correct
56 Correct 456 ms 55968 KB Output is correct
57 Correct 79 ms 40196 KB Output is correct
58 Correct 431 ms 55828 KB Output is correct
59 Correct 237 ms 47156 KB Output is correct
60 Correct 390 ms 55840 KB Output is correct
61 Correct 226 ms 53288 KB Output is correct
62 Correct 210 ms 52692 KB Output is correct
63 Correct 213 ms 51156 KB Output is correct
64 Correct 205 ms 51300 KB Output is correct
65 Correct 236 ms 53864 KB Output is correct
66 Correct 214 ms 52376 KB Output is correct
67 Correct 229 ms 52236 KB Output is correct
68 Correct 215 ms 52228 KB Output is correct
69 Correct 201 ms 52728 KB Output is correct
70 Correct 220 ms 52496 KB Output is correct
71 Correct 215 ms 52640 KB Output is correct
72 Correct 191 ms 50308 KB Output is correct
73 Incorrect 606 ms 65936 KB Output isn't correct
74 Halted 0 ms 0 KB -