oj.uz

답안 #785309

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
785309 2023-07-17T08:16:08 Z vjudge1 송신탑 (IOI22_towers) C++17
23 / 100
 4000 ms 13312 KB 
#include "towers.h"
#include <bits/stdc++.h>
using namespace std;
int N, p;
vector<int> H;
void init(int n, vector<int> h) {
    N = n, H = h, p = -1;
    for (int i = 0; i < N; i++) {
        if ((i == 0 || H[i] > H[i - 1]) && (i == N - 1 || H[i] > H[i + 1])) {
            p = i;
        }
    }
}
int max_towers(int L, int R, int D) {
    if (p != -1 && 0) {
        int l = upper_bound(H.begin(), H.begin() + p, H[p] - D) - H.begin() - 1;
        int r = lower_bound(H.begin() + p, H.end(), H[p] - D, [&](int x, int y) {return x > y;}) - H.begin();
        return (L <= l && r <= R) ? 2 : 1;
    }
    vector<int> lg(N + 1);
    for (int i = 2; i <= N; i++) {
        lg[i] = lg[i / 2] + 1;
    }
    vector st(N, vector<int>(lg[N] + 1));
    for (int i = 0; i < N; i++) {
        st[i][0] = H[i];
    }
    for (int j = 0; j < lg[N]; j++) {
        for (int i = 0; i + (2 << j) <= N; i++) {
            st[i][j + 1] = max(st[i][j], st[i + (1 << j)][j]);
        }
    }
    auto query = [&](int l, int r) {
        if (l == r) {
            return 0;
        }
        int k = lg[r - l];
        return max(st[l][k], st[r - (1 << k)][k]);
    };
    vector<int> l(N, -1), r(N, N);
    for (int i = 0; i < N; i++) {
        if (query(0, i) >= H[i] + D) {
            int lo = 0, hi = i - 1;
            while (lo < hi) {
                int mi = (lo + hi + 1) / 2;
                if (query(mi, i) >= H[i] + D) {
                    lo = mi;
                } else {
                    hi = mi - 1;
                }
            }
            l[i] = lo;
        }
        if (query(i + 1, N) >= H[i] + D) {
            int lo = i + 1, hi = N - 1;
            while (lo < hi) {
                int mi = (lo + hi) / 2;
                if (query(i + 1, mi + 1) >= H[i] + D) {
                    hi = mi;
                } else {
                    lo = mi + 1;
                }
            }
            r[i] = lo;
        }
    }
    vector<int> dp(N + 1), t(N + 1);
    for (int i = L; i <= R; i++) {
        t[i + 1] = max(t[i + 1], t[i]);
        dp[i + 1] = max(dp[i], t[l[i] + 1] + 1);
        if (r[i] < N) {
            t[r[i] + 1] = max(t[r[i] + 1], dp[i + 1]);
        }
    }
    return dp[R + 1];
}

Subtask #1
0 / 4.0

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

Subtask #2
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 504 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 464 KB Output is correct
30 Correct 1 ms 464 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct

Subtask #3
12.0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 504 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 464 KB Output is correct
30 Correct 1 ms 464 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 30 ms 8568 KB Output is correct
37 Correct 31 ms 13192 KB Output is correct
38 Correct 46 ms 13192 KB Output is correct
39 Correct 28 ms 13092 KB Output is correct
40 Correct 45 ms 13192 KB Output is correct
41 Correct 37 ms 13204 KB Output is correct
42 Correct 49 ms 13092 KB Output is correct
43 Correct 35 ms 13168 KB Output is correct
44 Correct 25 ms 13120 KB Output is correct
45 Correct 25 ms 13072 KB Output is correct
46 Correct 32 ms 13188 KB Output is correct
47 Correct 47 ms 13076 KB Output is correct
48 Correct 46 ms 13188 KB Output is correct
49 Correct 46 ms 13204 KB Output is correct
50 Correct 28 ms 13096 KB Output is correct
51 Correct 36 ms 13120 KB Output is correct
52 Correct 49 ms 13192 KB Output is correct
53 Correct 47 ms 13088 KB Output is correct
54 Correct 57 ms 13188 KB Output is correct
55 Correct 28 ms 13092 KB Output is correct
56 Correct 41 ms 13072 KB Output is correct
57 Correct 40 ms 12656 KB Output is correct
58 Correct 40 ms 13188 KB Output is correct
59 Correct 50 ms 13188 KB Output is correct
60 Correct 54 ms 13192 KB Output is correct
61 Correct 46 ms 13204 KB Output is correct
62 Correct 55 ms 13176 KB Output is correct
63 Correct 42 ms 13096 KB Output is correct
64 Correct 33 ms 13312 KB Output is correct
65 Correct 25 ms 13116 KB Output is correct
66 Correct 36 ms 13204 KB Output is correct
67 Correct 26 ms 13080 KB Output is correct

Subtask #4
0 / 14.0

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

Subtask #5
0 / 17.0

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

Subtask #6
0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 208 KB Output is correct
2 Correct 1 ms 464 KB Output is correct
3 Correct 1 ms 464 KB Output is correct
4 Correct 1 ms 464 KB Output is correct
5 Correct 1 ms 464 KB Output is correct
6 Correct 2 ms 464 KB Output is correct
7 Correct 1 ms 464 KB Output is correct
8 Correct 1 ms 464 KB Output is correct
9 Correct 1 ms 464 KB Output is correct
10 Correct 1 ms 464 KB Output is correct
11 Correct 1 ms 464 KB Output is correct
12 Correct 0 ms 208 KB Output is correct
13 Correct 1 ms 464 KB Output is correct
14 Correct 1 ms 464 KB Output is correct
15 Correct 2 ms 464 KB Output is correct
16 Correct 1 ms 464 KB Output is correct
17 Correct 1 ms 464 KB Output is correct
18 Correct 1 ms 464 KB Output is correct
19 Correct 1 ms 504 KB Output is correct
20 Correct 1 ms 464 KB Output is correct
21 Correct 1 ms 464 KB Output is correct
22 Correct 1 ms 464 KB Output is correct
23 Correct 1 ms 464 KB Output is correct
24 Correct 1 ms 464 KB Output is correct
25 Correct 1 ms 336 KB Output is correct
26 Correct 1 ms 464 KB Output is correct
27 Correct 1 ms 464 KB Output is correct
28 Correct 1 ms 464 KB Output is correct
29 Correct 1 ms 464 KB Output is correct
30 Correct 1 ms 464 KB Output is correct
31 Correct 1 ms 464 KB Output is correct
32 Correct 1 ms 464 KB Output is correct
33 Correct 1 ms 464 KB Output is correct
34 Correct 1 ms 464 KB Output is correct
35 Correct 1 ms 464 KB Output is correct
36 Correct 30 ms 8568 KB Output is correct
37 Correct 31 ms 13192 KB Output is correct
38 Correct 46 ms 13192 KB Output is correct
39 Correct 28 ms 13092 KB Output is correct
40 Correct 45 ms 13192 KB Output is correct
41 Correct 37 ms 13204 KB Output is correct
42 Correct 49 ms 13092 KB Output is correct
43 Correct 35 ms 13168 KB Output is correct
44 Correct 25 ms 13120 KB Output is correct
45 Correct 25 ms 13072 KB Output is correct
46 Correct 32 ms 13188 KB Output is correct
47 Correct 47 ms 13076 KB Output is correct
48 Correct 46 ms 13188 KB Output is correct
49 Correct 46 ms 13204 KB Output is correct
50 Correct 28 ms 13096 KB Output is correct
51 Correct 36 ms 13120 KB Output is correct
52 Correct 49 ms 13192 KB Output is correct
53 Correct 47 ms 13088 KB Output is correct
54 Correct 57 ms 13188 KB Output is correct
55 Correct 28 ms 13092 KB Output is correct
56 Correct 41 ms 13072 KB Output is correct
57 Correct 40 ms 12656 KB Output is correct
58 Correct 40 ms 13188 KB Output is correct
59 Correct 50 ms 13188 KB Output is correct
60 Correct 54 ms 13192 KB Output is correct
61 Correct 46 ms 13204 KB Output is correct
62 Correct 55 ms 13176 KB Output is correct
63 Correct 42 ms 13096 KB Output is correct
64 Correct 33 ms 13312 KB Output is correct
65 Correct 25 ms 13116 KB Output is correct
66 Correct 36 ms 13204 KB Output is correct
67 Correct 26 ms 13080 KB Output is correct
68 Execution timed out 4033 ms 13120 KB Time limit exceeded
69 Halted 0 ms 0 KB -

Subtask #7
0 / 23.0

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