oj.uz

Submission #489550

# Submission time Handle Problem Language Result Execution time Memory
489550 2021-11-23T07:40:25 Z KienTran Two Antennas (JOI19_antennas) C++14
100 / 100
 906 ms 124616 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){
        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 53 ms 94304 KB Output is correct
2 Correct 50 ms 94284 KB Output is correct
3 Correct 46 ms 94316 KB Output is correct
4 Correct 48 ms 94220 KB Output is correct
5 Correct 48 ms 94320 KB Output is correct
6 Correct 59 ms 94320 KB Output is correct
7 Correct 62 ms 94284 KB Output is correct
8 Correct 51 ms 94268 KB Output is correct
9 Correct 50 ms 94240 KB Output is correct
10 Correct 53 ms 94236 KB Output is correct
11 Correct 51 ms 94240 KB Output is correct
12 Correct 58 ms 94284 KB Output is correct
13 Correct 60 ms 94296 KB Output is correct
14 Correct 48 ms 94260 KB Output is correct
15 Correct 50 ms 94284 KB Output is correct
16 Correct 52 ms 94340 KB Output is correct
17 Correct 56 ms 94328 KB Output is correct
18 Correct 52 ms 94260 KB Output is correct
19 Correct 66 ms 94228 KB Output is correct
20 Correct 49 ms 94340 KB Output is correct
21 Correct 48 ms 94276 KB Output is correct
22 Correct 54 ms 94468 KB Output is correct
23 Correct 50 ms 94288 KB Output is correct
24 Correct 49 ms 94232 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 94304 KB Output is correct
2 Correct 50 ms 94284 KB Output is correct
3 Correct 46 ms 94316 KB Output is correct
4 Correct 48 ms 94220 KB Output is correct
5 Correct 48 ms 94320 KB Output is correct
6 Correct 59 ms 94320 KB Output is correct
7 Correct 62 ms 94284 KB Output is correct
8 Correct 51 ms 94268 KB Output is correct
9 Correct 50 ms 94240 KB Output is correct
10 Correct 53 ms 94236 KB Output is correct
11 Correct 51 ms 94240 KB Output is correct
12 Correct 58 ms 94284 KB Output is correct
13 Correct 60 ms 94296 KB Output is correct
14 Correct 48 ms 94260 KB Output is correct
15 Correct 50 ms 94284 KB Output is correct
16 Correct 52 ms 94340 KB Output is correct
17 Correct 56 ms 94328 KB Output is correct
18 Correct 52 ms 94260 KB Output is correct
19 Correct 66 ms 94228 KB Output is correct
20 Correct 49 ms 94340 KB Output is correct
21 Correct 48 ms 94276 KB Output is correct
22 Correct 54 ms 94468 KB Output is correct
23 Correct 50 ms 94288 KB Output is correct
24 Correct 49 ms 94232 KB Output is correct
25 Correct 135 ms 101472 KB Output is correct
26 Correct 60 ms 95044 KB Output is correct
27 Correct 183 ms 104156 KB Output is correct
28 Correct 177 ms 103900 KB Output is correct
29 Correct 134 ms 101712 KB Output is correct
30 Correct 135 ms 100988 KB Output is correct
31 Correct 163 ms 103432 KB Output is correct
32 Correct 176 ms 103924 KB Output is correct
33 Correct 174 ms 103804 KB Output is correct
34 Correct 108 ms 98884 KB Output is correct
35 Correct 169 ms 104372 KB Output is correct
36 Correct 229 ms 103984 KB Output is correct
37 Correct 122 ms 99448 KB Output is correct
38 Correct 171 ms 102956 KB Output is correct
39 Correct 69 ms 95600 KB Output is correct
40 Correct 175 ms 102892 KB Output is correct
41 Correct 139 ms 101064 KB Output is correct
42 Correct 168 ms 102856 KB Output is correct
43 Correct 107 ms 97300 KB Output is correct
44 Correct 172 ms 102960 KB Output is correct
45 Correct 71 ms 95856 KB Output is correct
46 Correct 175 ms 102928 KB Output is correct
47 Correct 83 ms 96604 KB Output is correct
48 Correct 176 ms 102964 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 383 ms 103624 KB Output is correct
2 Correct 439 ms 104776 KB Output is correct
3 Correct 305 ms 101656 KB Output is correct
4 Correct 453 ms 104780 KB Output is correct
5 Correct 229 ms 99064 KB Output is correct
6 Correct 552 ms 104732 KB Output is correct
7 Correct 385 ms 103396 KB Output is correct
8 Correct 450 ms 104732 KB Output is correct
9 Correct 84 ms 95940 KB Output is correct
10 Correct 446 ms 104676 KB Output is correct
11 Correct 258 ms 100916 KB Output is correct
12 Correct 425 ms 104780 KB Output is correct
13 Correct 253 ms 103900 KB Output is correct
14 Correct 242 ms 103592 KB Output is correct
15 Correct 273 ms 102864 KB Output is correct
16 Correct 226 ms 102768 KB Output is correct
17 Correct 263 ms 104388 KB Output is correct
18 Correct 243 ms 103388 KB Output is correct
19 Correct 256 ms 103704 KB Output is correct
20 Correct 245 ms 103648 KB Output is correct
21 Correct 227 ms 103784 KB Output is correct
22 Correct 312 ms 103536 KB Output is correct
23 Correct 240 ms 103692 KB Output is correct
24 Correct 217 ms 102228 KB Output is correct

Subtask #4
65.0 / 65.0

# Verdict Execution time Memory Grader output
1 Correct 53 ms 94304 KB Output is correct
2 Correct 50 ms 94284 KB Output is correct
3 Correct 46 ms 94316 KB Output is correct
4 Correct 48 ms 94220 KB Output is correct
5 Correct 48 ms 94320 KB Output is correct
6 Correct 59 ms 94320 KB Output is correct
7 Correct 62 ms 94284 KB Output is correct
8 Correct 51 ms 94268 KB Output is correct
9 Correct 50 ms 94240 KB Output is correct
10 Correct 53 ms 94236 KB Output is correct
11 Correct 51 ms 94240 KB Output is correct
12 Correct 58 ms 94284 KB Output is correct
13 Correct 60 ms 94296 KB Output is correct
14 Correct 48 ms 94260 KB Output is correct
15 Correct 50 ms 94284 KB Output is correct
16 Correct 52 ms 94340 KB Output is correct
17 Correct 56 ms 94328 KB Output is correct
18 Correct 52 ms 94260 KB Output is correct
19 Correct 66 ms 94228 KB Output is correct
20 Correct 49 ms 94340 KB Output is correct
21 Correct 48 ms 94276 KB Output is correct
22 Correct 54 ms 94468 KB Output is correct
23 Correct 50 ms 94288 KB Output is correct
24 Correct 49 ms 94232 KB Output is correct
25 Correct 135 ms 101472 KB Output is correct
26 Correct 60 ms 95044 KB Output is correct
27 Correct 183 ms 104156 KB Output is correct
28 Correct 177 ms 103900 KB Output is correct
29 Correct 134 ms 101712 KB Output is correct
30 Correct 135 ms 100988 KB Output is correct
31 Correct 163 ms 103432 KB Output is correct
32 Correct 176 ms 103924 KB Output is correct
33 Correct 174 ms 103804 KB Output is correct
34 Correct 108 ms 98884 KB Output is correct
35 Correct 169 ms 104372 KB Output is correct
36 Correct 229 ms 103984 KB Output is correct
37 Correct 122 ms 99448 KB Output is correct
38 Correct 171 ms 102956 KB Output is correct
39 Correct 69 ms 95600 KB Output is correct
40 Correct 175 ms 102892 KB Output is correct
41 Correct 139 ms 101064 KB Output is correct
42 Correct 168 ms 102856 KB Output is correct
43 Correct 107 ms 97300 KB Output is correct
44 Correct 172 ms 102960 KB Output is correct
45 Correct 71 ms 95856 KB Output is correct
46 Correct 175 ms 102928 KB Output is correct
47 Correct 83 ms 96604 KB Output is correct
48 Correct 176 ms 102964 KB Output is correct
49 Correct 383 ms 103624 KB Output is correct
50 Correct 439 ms 104776 KB Output is correct
51 Correct 305 ms 101656 KB Output is correct
52 Correct 453 ms 104780 KB Output is correct
53 Correct 229 ms 99064 KB Output is correct
54 Correct 552 ms 104732 KB Output is correct
55 Correct 385 ms 103396 KB Output is correct
56 Correct 450 ms 104732 KB Output is correct
57 Correct 84 ms 95940 KB Output is correct
58 Correct 446 ms 104676 KB Output is correct
59 Correct 258 ms 100916 KB Output is correct
60 Correct 425 ms 104780 KB Output is correct
61 Correct 253 ms 103900 KB Output is correct
62 Correct 242 ms 103592 KB Output is correct
63 Correct 273 ms 102864 KB Output is correct
64 Correct 226 ms 102768 KB Output is correct
65 Correct 263 ms 104388 KB Output is correct
66 Correct 243 ms 103388 KB Output is correct
67 Correct 256 ms 103704 KB Output is correct
68 Correct 245 ms 103648 KB Output is correct
69 Correct 227 ms 103784 KB Output is correct
70 Correct 312 ms 103536 KB Output is correct
71 Correct 240 ms 103692 KB Output is correct
72 Correct 217 ms 102228 KB Output is correct
73 Correct 708 ms 113460 KB Output is correct
74 Correct 489 ms 110892 KB Output is correct
75 Correct 646 ms 119352 KB Output is correct
76 Correct 906 ms 124616 KB Output is correct
77 Correct 454 ms 111320 KB Output is correct
78 Correct 712 ms 120092 KB Output is correct
79 Correct 773 ms 122088 KB Output is correct
80 Correct 796 ms 124476 KB Output is correct
81 Correct 277 ms 108708 KB Output is correct
82 Correct 600 ms 117508 KB Output is correct
83 Correct 566 ms 117628 KB Output is correct
84 Correct 821 ms 124492 KB Output is correct
85 Correct 453 ms 117272 KB Output is correct
86 Correct 592 ms 122088 KB Output is correct
87 Correct 296 ms 109836 KB Output is correct
88 Correct 572 ms 121300 KB Output is correct
89 Correct 522 ms 119744 KB Output is correct
90 Correct 609 ms 121872 KB Output is correct
91 Correct 358 ms 113560 KB Output is correct
92 Correct 587 ms 122064 KB Output is correct
93 Correct 296 ms 111144 KB Output is correct
94 Correct 574 ms 121916 KB Output is correct
95 Correct 331 ms 112596 KB Output is correct
96 Correct 558 ms 120708 KB Output is correct