oj.uz

Submission #1022902

# Submission time Handle Problem Language Result Execution time Memory
1022902 2024-07-14T07:23:39 Z vjudge1 Radio Towers (IOI22_towers) C++17
27 / 100
 4000 ms 3928 KB 
#include "towers.h"
#include<bits/stdc++.h>

using namespace std;

#define rall(s) s.rbegin(), s.rend()
#define all(s) s.begin(), s.end()
#define sz(s) (int)s.size()
#define s second 
#define f first 

using ll = long long;
using pii = pair<int, int>; 
using pll = pair<ll, ll>;

vector<int> h;
int n, k, ok = 1;
const int inf = 1e9, N1 = 2e5;

pii t[4 * N1];

void bld(int u = 1, int tl = 0, int tr = n - 1) {
    if (tl == tr) {
        t[u] = {tl, tl};
        return;
    }
    int m = (tl + tr) / 2;
    bld(u * 2, tl, m);
    bld(u * 2 + 1, m + 1, tr);
    t[u] = t[u * 2 + 1];
    if (h[t[u * 2].f] > h[t[u].f]) t[u].f = t[u * 2].f;
    if (h[t[u * 2].s] < h[t[u].s]) t[u].s = t[u * 2].s;
}

void init(int N, vector<int> H) {
    n = N, h = H;
    k = n - 1;
    for (int i = 1; i < n; i++) {
        if (h[i] < h[i - 1]) {
            k = i - 1;
            break;
        }
    }
    for (int i = 1; i < k; i++) {
        if (h[i - 1] > h[i]) ok = 0;
    }
    for (int i = k + 1; i < n; i++) {
        if (h[i - 1] < h[i]) ok = 0;
    }
    bld();
}


pii get(int l, int r, int u = 1, int tl = 0, int tr = n - 1) {
    if (tl > r || tr < l) return {-1, -1};
    if (tl >= l && tr <= r) return t[u];
    int m = (tl + tr) / 2;
    auto [x1, x2] = get(l, r, u * 2, tl, m);
    auto [y1, y2] = get(l, r, u * 2 + 1, m + 1, tr);
    if (x1 == -1) return {y1, y2};
    if (y1 == -1) return {x1, x2};
    if (h[y1] > h[x1]) x1 = y1;
    if (h[y2] < h[x2]) x2 = y2;
    return {x1, x2};
}

int f(int l, int r, int d, int mx) {
    if (r < l) return 0;
    if (l == r) return (h[l] <= mx);
    auto [pos, ps] = get(l, r);
    if (h[ps] > mx) return 0;
    if (pos == l) return f(l + 1, r, d, mx);
    if (pos == r) return f(l, r - 1, d, mx);
    return max(1, f(l, pos - 1, d, min(mx, h[pos] - d)) + f(pos + 1, r, d, min(mx, h[pos] - d)));
}

int max_towers(int l, int r, int d) {
    if (ok) {
        if (k == -1) return 1;
        if (k <= l || r <= k) return 1;
        if (h[l] > h[k] - d || h[r] > h[k] - d) return 1;
        return 2;
    }
    return f(l, r, d, inf);
}

Subtask #1
4.0 / 4.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 3160 KB Output is correct
2 Correct 597 ms 3672 KB Output is correct
3 Correct 646 ms 3672 KB Output is correct
4 Correct 687 ms 3652 KB Output is correct
5 Correct 680 ms 3672 KB Output is correct
6 Correct 652 ms 3672 KB Output is correct
7 Correct 606 ms 3672 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct

Subtask #2
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 448 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 596 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct

Subtask #3
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 448 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 596 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 9 ms 3416 KB Output is correct
37 Correct 22 ms 3672 KB Output is correct
38 Correct 21 ms 3672 KB Output is correct
39 Correct 19 ms 3672 KB Output is correct
40 Correct 11 ms 3672 KB Output is correct
41 Correct 27 ms 3672 KB Output is correct
42 Correct 10 ms 3672 KB Output is correct
43 Correct 13 ms 3748 KB Output is correct
44 Correct 9 ms 3928 KB Output is correct
45 Correct 12 ms 3672 KB Output is correct
46 Correct 18 ms 3672 KB Output is correct
47 Correct 15 ms 3660 KB Output is correct
48 Correct 14 ms 3672 KB Output is correct
49 Correct 12 ms 3672 KB Output is correct
50 Correct 18 ms 3672 KB Output is correct
51 Correct 20 ms 3672 KB Output is correct
52 Correct 24 ms 3672 KB Output is correct
53 Correct 21 ms 3672 KB Output is correct
54 Correct 18 ms 3660 KB Output is correct
55 Correct 10 ms 3672 KB Output is correct
56 Correct 32 ms 3660 KB Output is correct
57 Correct 18 ms 3644 KB Output is correct
58 Correct 20 ms 3672 KB Output is correct
59 Correct 29 ms 3672 KB Output is correct
60 Correct 32 ms 3924 KB Output is correct
61 Correct 32 ms 3656 KB Output is correct
62 Correct 28 ms 3672 KB Output is correct
63 Correct 34 ms 3664 KB Output is correct
64 Correct 11 ms 3660 KB Output is correct
65 Correct 16 ms 3672 KB Output is correct
66 Correct 42 ms 3672 KB Output is correct
67 Correct 19 ms 3672 KB Output is correct

Subtask #4
0 / 14.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4075 ms 3672 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 17.0

# Verdict Execution time Memory Grader output
1 Execution timed out 4014 ms 2832 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 344 KB Output is correct
3 Correct 1 ms 344 KB Output is correct
4 Correct 1 ms 344 KB Output is correct
5 Correct 1 ms 344 KB Output is correct
6 Correct 1 ms 344 KB Output is correct
7 Correct 1 ms 344 KB Output is correct
8 Correct 0 ms 448 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 596 KB Output is correct
13 Correct 0 ms 344 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 1 ms 344 KB Output is correct
22 Correct 1 ms 344 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 0 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 0 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 9 ms 3416 KB Output is correct
37 Correct 22 ms 3672 KB Output is correct
38 Correct 21 ms 3672 KB Output is correct
39 Correct 19 ms 3672 KB Output is correct
40 Correct 11 ms 3672 KB Output is correct
41 Correct 27 ms 3672 KB Output is correct
42 Correct 10 ms 3672 KB Output is correct
43 Correct 13 ms 3748 KB Output is correct
44 Correct 9 ms 3928 KB Output is correct
45 Correct 12 ms 3672 KB Output is correct
46 Correct 18 ms 3672 KB Output is correct
47 Correct 15 ms 3660 KB Output is correct
48 Correct 14 ms 3672 KB Output is correct
49 Correct 12 ms 3672 KB Output is correct
50 Correct 18 ms 3672 KB Output is correct
51 Correct 20 ms 3672 KB Output is correct
52 Correct 24 ms 3672 KB Output is correct
53 Correct 21 ms 3672 KB Output is correct
54 Correct 18 ms 3660 KB Output is correct
55 Correct 10 ms 3672 KB Output is correct
56 Correct 32 ms 3660 KB Output is correct
57 Correct 18 ms 3644 KB Output is correct
58 Correct 20 ms 3672 KB Output is correct
59 Correct 29 ms 3672 KB Output is correct
60 Correct 32 ms 3924 KB Output is correct
61 Correct 32 ms 3656 KB Output is correct
62 Correct 28 ms 3672 KB Output is correct
63 Correct 34 ms 3664 KB Output is correct
64 Correct 11 ms 3660 KB Output is correct
65 Correct 16 ms 3672 KB Output is correct
66 Correct 42 ms 3672 KB Output is correct
67 Correct 19 ms 3672 KB Output is correct
68 Execution timed out 4075 ms 3672 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 320 ms 3160 KB Output is correct
2 Correct 597 ms 3672 KB Output is correct
3 Correct 646 ms 3672 KB Output is correct
4 Correct 687 ms 3652 KB Output is correct
5 Correct 680 ms 3672 KB Output is correct
6 Correct 652 ms 3672 KB Output is correct
7 Correct 606 ms 3672 KB Output is correct
8 Correct 0 ms 344 KB Output is correct
9 Correct 0 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 0 ms 344 KB Output is correct
12 Correct 0 ms 344 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 1 ms 344 KB Output is correct
15 Correct 1 ms 344 KB Output is correct
16 Correct 1 ms 344 KB Output is correct
17 Correct 1 ms 344 KB Output is correct
18 Correct 0 ms 448 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 1 ms 344 KB Output is correct
21 Correct 0 ms 344 KB Output is correct
22 Correct 0 ms 596 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 344 KB Output is correct
26 Correct 1 ms 344 KB Output is correct
27 Correct 1 ms 344 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 1 ms 344 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 344 KB Output is correct
36 Correct 1 ms 344 KB Output is correct
37 Correct 1 ms 344 KB Output is correct
38 Correct 1 ms 344 KB Output is correct
39 Correct 1 ms 344 KB Output is correct
40 Correct 1 ms 344 KB Output is correct
41 Correct 1 ms 344 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 0 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 9 ms 3416 KB Output is correct
47 Correct 22 ms 3672 KB Output is correct
48 Correct 21 ms 3672 KB Output is correct
49 Correct 19 ms 3672 KB Output is correct
50 Correct 11 ms 3672 KB Output is correct
51 Correct 27 ms 3672 KB Output is correct
52 Correct 10 ms 3672 KB Output is correct
53 Correct 13 ms 3748 KB Output is correct
54 Correct 9 ms 3928 KB Output is correct
55 Correct 12 ms 3672 KB Output is correct
56 Correct 18 ms 3672 KB Output is correct
57 Correct 15 ms 3660 KB Output is correct
58 Correct 14 ms 3672 KB Output is correct
59 Correct 12 ms 3672 KB Output is correct
60 Correct 18 ms 3672 KB Output is correct
61 Correct 20 ms 3672 KB Output is correct
62 Correct 24 ms 3672 KB Output is correct
63 Correct 21 ms 3672 KB Output is correct
64 Correct 18 ms 3660 KB Output is correct
65 Correct 10 ms 3672 KB Output is correct
66 Correct 32 ms 3660 KB Output is correct
67 Correct 18 ms 3644 KB Output is correct
68 Correct 20 ms 3672 KB Output is correct
69 Correct 29 ms 3672 KB Output is correct
70 Correct 32 ms 3924 KB Output is correct
71 Correct 32 ms 3656 KB Output is correct
72 Correct 28 ms 3672 KB Output is correct
73 Correct 34 ms 3664 KB Output is correct
74 Correct 11 ms 3660 KB Output is correct
75 Correct 16 ms 3672 KB Output is correct
76 Correct 42 ms 3672 KB Output is correct
77 Correct 19 ms 3672 KB Output is correct
78 Execution timed out 4075 ms 3672 KB Time limit exceeded
79 Halted 0 ms 0 KB -