oj.uz

답안 #1023006

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1023006 2024-07-14T08:38:47 Z mansur 송신탑 (IOI22_towers) C++17
44 / 100
 4000 ms 32592 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 = 3e7;

pii t[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;
}

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 t2[N1], vl[N1], vr[N1], cur = 1;

void upd(int l, int r, int u = 1, int tl = 1, int tr = inf) {
    if (tl > r || tr < l || r < l) return;
    if (tl >= l && tr <= r) {
        t2[u]++;
        return;
    }
    int m = (tl + tr) / 2;
    if (!vl[u]) vl[u] = ++cur;
    if (!vr[u]) vr[u] = ++cur;
    upd(l, r, vl[u], tl, m);
    upd(l, r, vr[u], m + 1, tr);
}

int gt(int p, int u = 1, int tl = 1, int tr = inf) {
    if (tl == tr) return t2[u];
    int m = (tl + + tr) / 2;
    if (p <= m) {
        if (vl[u]) return gt(p, vl[u], tl, m) + t2[u];
        return t2[u];
    }
    if (vr[u]) return gt(p, vr[u], m + 1, tr) + t2[u];
    return t2[u];
}

void calc(int l, int r, int mx) {
    if (r < l) return;
    if (l == r) {
        upd(1, min(inf, mx - h[l]));
        return; 
    }
    auto [pos, ps] = get(l, r);
    if (pos == l) calc(l + 1, r, mx);
    else if (pos == r) calc(l, r - 1, mx);
    else {
        upd(h[pos] - h[ps] + 1, min(inf, mx - h[ps]));
        calc(l, pos - 1, h[pos]);
        calc(pos + 1, r, h[pos]);
    }
}

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();
    calc(0, n - 1, 2 * inf);
}

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;
    }
    if (l == 0 && r == n - 1) {
        return gt(d);
    }
    return f(l, r, d, inf);
}

Subtask #1
4.0 / 4.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 2388 KB Output is correct
2 Correct 602 ms 3672 KB Output is correct
3 Correct 614 ms 3672 KB Output is correct
4 Correct 662 ms 3672 KB Output is correct
5 Correct 613 ms 3672 KB Output is correct
6 Correct 642 ms 3672 KB Output is correct
7 Correct 650 ms 3672 KB Output is correct
8 Correct 0 ms 596 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 2 ms 856 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 2 ms 1368 KB Output is correct
5 Correct 2 ms 1368 KB Output is correct
6 Correct 2 ms 1112 KB Output is correct
7 Correct 2 ms 1112 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 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 0 ms 344 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 2 ms 1112 KB Output is correct
17 Correct 2 ms 1112 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 2 ms 856 KB Output is correct
21 Correct 2 ms 1112 KB Output is correct
22 Correct 2 ms 1252 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 856 KB Output is correct
27 Correct 1 ms 856 KB Output is correct
28 Correct 2 ms 1112 KB Output is correct
29 Correct 1 ms 1112 KB Output is correct
30 Correct 2 ms 1112 KB Output is correct
31 Correct 2 ms 1368 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 2 ms 856 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 2 ms 1368 KB Output is correct
5 Correct 2 ms 1368 KB Output is correct
6 Correct 2 ms 1112 KB Output is correct
7 Correct 2 ms 1112 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 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 0 ms 344 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 2 ms 1112 KB Output is correct
17 Correct 2 ms 1112 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 2 ms 856 KB Output is correct
21 Correct 2 ms 1112 KB Output is correct
22 Correct 2 ms 1252 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 856 KB Output is correct
27 Correct 1 ms 856 KB Output is correct
28 Correct 2 ms 1112 KB Output is correct
29 Correct 1 ms 1112 KB Output is correct
30 Correct 2 ms 1112 KB Output is correct
31 Correct 2 ms 1368 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 48 ms 15880 KB Output is correct
37 Correct 58 ms 23888 KB Output is correct
38 Correct 60 ms 23896 KB Output is correct
39 Correct 76 ms 32456 KB Output is correct
40 Correct 76 ms 32560 KB Output is correct
41 Correct 89 ms 32356 KB Output is correct
42 Correct 75 ms 32336 KB Output is correct
43 Correct 19 ms 3672 KB Output is correct
44 Correct 19 ms 3672 KB Output is correct
45 Correct 24 ms 3672 KB Output is correct
46 Correct 22 ms 3660 KB Output is correct
47 Correct 64 ms 23800 KB Output is correct
48 Correct 81 ms 32552 KB Output is correct
49 Correct 81 ms 32336 KB Output is correct
50 Correct 19 ms 3672 KB Output is correct
51 Correct 26 ms 3456 KB Output is correct
52 Correct 58 ms 23888 KB Output is correct
53 Correct 76 ms 32336 KB Output is correct
54 Correct 79 ms 32336 KB Output is correct
55 Correct 20 ms 3656 KB Output is correct
56 Correct 23 ms 3672 KB Output is correct
57 Correct 56 ms 23180 KB Output is correct
58 Correct 64 ms 23820 KB Output is correct
59 Correct 60 ms 23888 KB Output is correct
60 Correct 83 ms 32548 KB Output is correct
61 Correct 78 ms 32336 KB Output is correct
62 Correct 79 ms 32336 KB Output is correct
63 Correct 76 ms 32336 KB Output is correct
64 Correct 20 ms 3672 KB Output is correct
65 Correct 25 ms 3688 KB Output is correct
66 Correct 24 ms 3672 KB Output is correct
67 Correct 20 ms 3672 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4042 ms 23632 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 240 ms 6876 KB Output is correct
2 Correct 799 ms 23876 KB Output is correct
3 Correct 779 ms 23888 KB Output is correct
4 Correct 887 ms 32592 KB Output is correct
5 Correct 842 ms 32336 KB Output is correct
6 Correct 855 ms 32336 KB Output is correct
7 Correct 890 ms 32396 KB Output is correct
8 Correct 640 ms 3672 KB Output is correct
9 Correct 717 ms 3672 KB Output is correct
10 Correct 656 ms 3672 KB Output is correct
11 Correct 682 ms 3672 KB Output is correct
12 Correct 75 ms 23888 KB Output is correct
13 Correct 94 ms 32336 KB Output is correct
14 Correct 109 ms 32568 KB Output is correct
15 Correct 21 ms 3508 KB Output is correct
16 Correct 24 ms 3672 KB Output is correct
17 Correct 70 ms 23096 KB Output is correct
18 Correct 63 ms 23848 KB Output is correct
19 Correct 65 ms 23884 KB Output is correct
20 Correct 84 ms 32348 KB Output is correct
21 Correct 86 ms 32336 KB Output is correct
22 Correct 86 ms 32336 KB Output is correct
23 Correct 85 ms 32508 KB Output is correct
24 Correct 21 ms 3672 KB Output is correct
25 Correct 20 ms 3672 KB Output is correct
26 Correct 24 ms 3512 KB Output is correct
27 Correct 21 ms 3672 KB Output is correct
28 Correct 2 ms 856 KB Output is correct
29 Correct 2 ms 1112 KB Output is correct
30 Correct 3 ms 1112 KB Output is correct
31 Correct 1 ms 344 KB Output is correct
32 Correct 2 ms 344 KB Output is correct
33 Correct 1 ms 624 KB Output is correct
34 Correct 1 ms 1036 KB Output is correct
35 Correct 2 ms 852 KB Output is correct
36 Correct 2 ms 1364 KB Output is correct
37 Correct 2 ms 1112 KB Output is correct
38 Correct 2 ms 1112 KB Output is correct
39 Correct 2 ms 1148 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

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 600 KB Output is correct
2 Correct 2 ms 856 KB Output is correct
3 Correct 1 ms 856 KB Output is correct
4 Correct 2 ms 1368 KB Output is correct
5 Correct 2 ms 1368 KB Output is correct
6 Correct 2 ms 1112 KB Output is correct
7 Correct 2 ms 1112 KB Output is correct
8 Correct 1 ms 344 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 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 0 ms 344 KB Output is correct
15 Correct 2 ms 856 KB Output is correct
16 Correct 2 ms 1112 KB Output is correct
17 Correct 2 ms 1112 KB Output is correct
18 Correct 1 ms 344 KB Output is correct
19 Correct 1 ms 344 KB Output is correct
20 Correct 2 ms 856 KB Output is correct
21 Correct 2 ms 1112 KB Output is correct
22 Correct 2 ms 1252 KB Output is correct
23 Correct 0 ms 344 KB Output is correct
24 Correct 1 ms 344 KB Output is correct
25 Correct 1 ms 600 KB Output is correct
26 Correct 1 ms 856 KB Output is correct
27 Correct 1 ms 856 KB Output is correct
28 Correct 2 ms 1112 KB Output is correct
29 Correct 1 ms 1112 KB Output is correct
30 Correct 2 ms 1112 KB Output is correct
31 Correct 2 ms 1368 KB Output is correct
32 Correct 1 ms 344 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 344 KB Output is correct
36 Correct 48 ms 15880 KB Output is correct
37 Correct 58 ms 23888 KB Output is correct
38 Correct 60 ms 23896 KB Output is correct
39 Correct 76 ms 32456 KB Output is correct
40 Correct 76 ms 32560 KB Output is correct
41 Correct 89 ms 32356 KB Output is correct
42 Correct 75 ms 32336 KB Output is correct
43 Correct 19 ms 3672 KB Output is correct
44 Correct 19 ms 3672 KB Output is correct
45 Correct 24 ms 3672 KB Output is correct
46 Correct 22 ms 3660 KB Output is correct
47 Correct 64 ms 23800 KB Output is correct
48 Correct 81 ms 32552 KB Output is correct
49 Correct 81 ms 32336 KB Output is correct
50 Correct 19 ms 3672 KB Output is correct
51 Correct 26 ms 3456 KB Output is correct
52 Correct 58 ms 23888 KB Output is correct
53 Correct 76 ms 32336 KB Output is correct
54 Correct 79 ms 32336 KB Output is correct
55 Correct 20 ms 3656 KB Output is correct
56 Correct 23 ms 3672 KB Output is correct
57 Correct 56 ms 23180 KB Output is correct
58 Correct 64 ms 23820 KB Output is correct
59 Correct 60 ms 23888 KB Output is correct
60 Correct 83 ms 32548 KB Output is correct
61 Correct 78 ms 32336 KB Output is correct
62 Correct 79 ms 32336 KB Output is correct
63 Correct 76 ms 32336 KB Output is correct
64 Correct 20 ms 3672 KB Output is correct
65 Correct 25 ms 3688 KB Output is correct
66 Correct 24 ms 3672 KB Output is correct
67 Correct 20 ms 3672 KB Output is correct
68 Execution timed out 4042 ms 23632 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 324 ms 2388 KB Output is correct
2 Correct 602 ms 3672 KB Output is correct
3 Correct 614 ms 3672 KB Output is correct
4 Correct 662 ms 3672 KB Output is correct
5 Correct 613 ms 3672 KB Output is correct
6 Correct 642 ms 3672 KB Output is correct
7 Correct 650 ms 3672 KB Output is correct
8 Correct 0 ms 596 KB Output is correct
9 Correct 1 ms 344 KB Output is correct
10 Correct 1 ms 344 KB Output is correct
11 Correct 1 ms 600 KB Output is correct
12 Correct 2 ms 856 KB Output is correct
13 Correct 1 ms 856 KB Output is correct
14 Correct 2 ms 1368 KB Output is correct
15 Correct 2 ms 1368 KB Output is correct
16 Correct 2 ms 1112 KB Output is correct
17 Correct 2 ms 1112 KB Output is correct
18 Correct 1 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 0 ms 344 KB Output is correct
23 Correct 1 ms 344 KB Output is correct
24 Correct 0 ms 344 KB Output is correct
25 Correct 2 ms 856 KB Output is correct
26 Correct 2 ms 1112 KB Output is correct
27 Correct 2 ms 1112 KB Output is correct
28 Correct 1 ms 344 KB Output is correct
29 Correct 1 ms 344 KB Output is correct
30 Correct 2 ms 856 KB Output is correct
31 Correct 2 ms 1112 KB Output is correct
32 Correct 2 ms 1252 KB Output is correct
33 Correct 0 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 1 ms 600 KB Output is correct
36 Correct 1 ms 856 KB Output is correct
37 Correct 1 ms 856 KB Output is correct
38 Correct 2 ms 1112 KB Output is correct
39 Correct 1 ms 1112 KB Output is correct
40 Correct 2 ms 1112 KB Output is correct
41 Correct 2 ms 1368 KB Output is correct
42 Correct 1 ms 344 KB Output is correct
43 Correct 1 ms 344 KB Output is correct
44 Correct 1 ms 344 KB Output is correct
45 Correct 1 ms 344 KB Output is correct
46 Correct 48 ms 15880 KB Output is correct
47 Correct 58 ms 23888 KB Output is correct
48 Correct 60 ms 23896 KB Output is correct
49 Correct 76 ms 32456 KB Output is correct
50 Correct 76 ms 32560 KB Output is correct
51 Correct 89 ms 32356 KB Output is correct
52 Correct 75 ms 32336 KB Output is correct
53 Correct 19 ms 3672 KB Output is correct
54 Correct 19 ms 3672 KB Output is correct
55 Correct 24 ms 3672 KB Output is correct
56 Correct 22 ms 3660 KB Output is correct
57 Correct 64 ms 23800 KB Output is correct
58 Correct 81 ms 32552 KB Output is correct
59 Correct 81 ms 32336 KB Output is correct
60 Correct 19 ms 3672 KB Output is correct
61 Correct 26 ms 3456 KB Output is correct
62 Correct 58 ms 23888 KB Output is correct
63 Correct 76 ms 32336 KB Output is correct
64 Correct 79 ms 32336 KB Output is correct
65 Correct 20 ms 3656 KB Output is correct
66 Correct 23 ms 3672 KB Output is correct
67 Correct 56 ms 23180 KB Output is correct
68 Correct 64 ms 23820 KB Output is correct
69 Correct 60 ms 23888 KB Output is correct
70 Correct 83 ms 32548 KB Output is correct
71 Correct 78 ms 32336 KB Output is correct
72 Correct 79 ms 32336 KB Output is correct
73 Correct 76 ms 32336 KB Output is correct
74 Correct 20 ms 3672 KB Output is correct
75 Correct 25 ms 3688 KB Output is correct
76 Correct 24 ms 3672 KB Output is correct
77 Correct 20 ms 3672 KB Output is correct
78 Execution timed out 4042 ms 23632 KB Time limit exceeded
79 Halted 0 ms 0 KB -