oj.uz

답안 #572735

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
572735 2022-06-05T07:16:24 Z Cyanmond The short shank; Redemption (BOI21_prison) C++17
100 / 100
 1016 ms 163560 KB 
#include <bits/stdc++.h>

using namespace std;
using i64 = long long;

constexpr int inf = 1000000100;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REP3(i, l, r) for (int i = (l); i < (r); ++i)
#define RVP(i, n) for (int i = (n - 1); i >= 0; --i)

#define ALL(x) (x).begin(), (x).end()
int main() {
    int N, D, T;
    cin >> N >> D >> T;
    vector<int> t(N);
    for (auto &e : t) cin >> e;

    stack<int> stk;
    vector<int> ml(N, N);
    int count_v = 0;
    REP(i, N) {
        while ((not stk.empty()) and stk.top() + (T - t[stk.top()]) < i) stk.pop();
        if (t[i] <= T) {
            ++count_v;
            while ((not stk.empty()) and t[stk.top()] + i >= t[i] + stk.top()) stk.pop();
            stk.push(i);
        } else {
            if (stk.empty()) continue;
            ++count_v;
            ml[i] = stk.top();
        }
    }
    while (not stk.empty()) stk.pop();

    vector<int> b(N, N);
    RVP(i, N) {
        if (ml[i] == N) continue;
        while ((not stk.empty()) and ml[stk.top()] >= i) stk.pop();
        if (not stk.empty())
            b[i] = stk.top();
        else
            b[i] = N + 1; // base

        while ((not stk.empty()) and ml[stk.top()] >= ml[i]) stk.pop();
        stk.push(i);
    }

    vector<vector<int>> g(N);
    REP(i, N) if (b[i] < N) g[b[i]].push_back(i);

    vector<int> madpt(N, -1), chd(N, -1);
    {
        auto dfs = [&](auto &&self, const int v) -> void {
            if (madpt[v] != -1) return;
            madpt[v] = 1;
            for (const int t : g[v]) {
                self(self, t);
                if (madpt[v] < madpt[t] + 1) {
                    madpt[v] = madpt[t] + 1;
                    chd[v] = t;
                }
            }
            return;
        };
        REP(i, N) dfs(dfs, i);
    }
    vector<pair<int, int>> vs;
    REP(i, N) if (madpt[i] != -1) vs.push_back({madpt[i], i});
    sort(ALL(vs), greater());
    vector<bool> used(N);
    int sum = 0;
    REP(i, (int)size(vs)) {
        if (used[vs[i].second]) continue;
        sum += vs[i].first;
        int now = vs[i].second;
        while (now != -1) {
            used[now] = true;
            now = chd[now];
        }
        --D;
        if (D == 0) break;
    }
    cout << count_v - sum << endl;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 258 ms 29972 KB Output is correct
3 Correct 227 ms 27836 KB Output is correct
4 Correct 205 ms 30632 KB Output is correct
5 Correct 172 ms 33724 KB Output is correct
6 Correct 205 ms 29636 KB Output is correct
7 Correct 205 ms 41668 KB Output is correct
8 Correct 209 ms 30264 KB Output is correct

Subtask #3
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 3 ms 596 KB Output is correct
24 Correct 2 ms 568 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 3 ms 608 KB Output is correct
29 Correct 2 ms 608 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 440 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 568 KB Output is correct

Subtask #4
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 38 ms 5524 KB Output is correct
3 Correct 37 ms 5952 KB Output is correct
4 Correct 32 ms 6468 KB Output is correct
5 Correct 36 ms 6972 KB Output is correct
6 Correct 37 ms 7108 KB Output is correct
7 Correct 30 ms 5700 KB Output is correct
8 Correct 29 ms 5696 KB Output is correct
9 Correct 30 ms 7496 KB Output is correct
10 Correct 26 ms 5184 KB Output is correct

Subtask #5
25.0 / 25.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 1 ms 340 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 3 ms 596 KB Output is correct
24 Correct 2 ms 568 KB Output is correct
25 Correct 3 ms 596 KB Output is correct
26 Correct 3 ms 596 KB Output is correct
27 Correct 2 ms 596 KB Output is correct
28 Correct 3 ms 608 KB Output is correct
29 Correct 2 ms 608 KB Output is correct
30 Correct 3 ms 468 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 2 ms 468 KB Output is correct
33 Correct 2 ms 440 KB Output is correct
34 Correct 2 ms 596 KB Output is correct
35 Correct 2 ms 568 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 38 ms 5524 KB Output is correct
38 Correct 37 ms 5952 KB Output is correct
39 Correct 32 ms 6468 KB Output is correct
40 Correct 36 ms 6972 KB Output is correct
41 Correct 37 ms 7108 KB Output is correct
42 Correct 30 ms 5700 KB Output is correct
43 Correct 29 ms 5696 KB Output is correct
44 Correct 30 ms 7496 KB Output is correct
45 Correct 26 ms 5184 KB Output is correct
46 Correct 0 ms 212 KB Output is correct
47 Correct 1 ms 300 KB Output is correct
48 Correct 1 ms 340 KB Output is correct
49 Correct 1 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 1 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 1 ms 296 KB Output is correct
54 Correct 1 ms 296 KB Output is correct
55 Correct 1 ms 212 KB Output is correct
56 Correct 1 ms 212 KB Output is correct
57 Correct 3 ms 596 KB Output is correct
58 Correct 2 ms 596 KB Output is correct
59 Correct 2 ms 572 KB Output is correct
60 Correct 3 ms 596 KB Output is correct
61 Correct 3 ms 596 KB Output is correct
62 Correct 2 ms 596 KB Output is correct
63 Correct 2 ms 612 KB Output is correct
64 Correct 2 ms 468 KB Output is correct
65 Correct 2 ms 576 KB Output is correct
66 Correct 2 ms 468 KB Output is correct
67 Correct 2 ms 468 KB Output is correct
68 Correct 2 ms 596 KB Output is correct
69 Correct 2 ms 596 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 39 ms 6216 KB Output is correct
72 Correct 39 ms 5956 KB Output is correct
73 Correct 33 ms 6424 KB Output is correct
74 Correct 37 ms 7020 KB Output is correct
75 Correct 35 ms 7084 KB Output is correct
76 Correct 29 ms 5712 KB Output is correct
77 Correct 29 ms 5704 KB Output is correct
78 Correct 29 ms 7508 KB Output is correct
79 Correct 26 ms 5188 KB Output is correct
80 Correct 38 ms 5952 KB Output is correct
81 Correct 39 ms 6348 KB Output is correct
82 Correct 38 ms 5936 KB Output is correct
83 Correct 29 ms 6476 KB Output is correct
84 Correct 23 ms 5964 KB Output is correct
85 Correct 35 ms 7256 KB Output is correct
86 Correct 30 ms 5968 KB Output is correct
87 Correct 29 ms 5572 KB Output is correct
88 Correct 32 ms 6992 KB Output is correct
89 Correct 30 ms 7396 KB Output is correct
90 Correct 32 ms 6724 KB Output is correct

Subtask #6
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 304 KB Output is correct
4 Correct 1 ms 340 KB Output is correct
5 Correct 1 ms 340 KB Output is correct
6 Correct 1 ms 296 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 1 ms 296 KB Output is correct
9 Correct 1 ms 300 KB Output is correct
10 Correct 1 ms 212 KB Output is correct
11 Correct 0 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 258 ms 29972 KB Output is correct
14 Correct 227 ms 27836 KB Output is correct
15 Correct 205 ms 30632 KB Output is correct
16 Correct 172 ms 33724 KB Output is correct
17 Correct 205 ms 29636 KB Output is correct
18 Correct 205 ms 41668 KB Output is correct
19 Correct 209 ms 30264 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 0 ms 212 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 3 ms 596 KB Output is correct
32 Correct 2 ms 568 KB Output is correct
33 Correct 3 ms 596 KB Output is correct
34 Correct 3 ms 596 KB Output is correct
35 Correct 2 ms 596 KB Output is correct
36 Correct 3 ms 608 KB Output is correct
37 Correct 2 ms 608 KB Output is correct
38 Correct 3 ms 468 KB Output is correct
39 Correct 2 ms 468 KB Output is correct
40 Correct 2 ms 468 KB Output is correct
41 Correct 2 ms 440 KB Output is correct
42 Correct 2 ms 596 KB Output is correct
43 Correct 2 ms 568 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 38 ms 5524 KB Output is correct
46 Correct 37 ms 5952 KB Output is correct
47 Correct 32 ms 6468 KB Output is correct
48 Correct 36 ms 6972 KB Output is correct
49 Correct 37 ms 7108 KB Output is correct
50 Correct 30 ms 5700 KB Output is correct
51 Correct 29 ms 5696 KB Output is correct
52 Correct 30 ms 7496 KB Output is correct
53 Correct 26 ms 5184 KB Output is correct
54 Correct 0 ms 212 KB Output is correct
55 Correct 1 ms 300 KB Output is correct
56 Correct 1 ms 340 KB Output is correct
57 Correct 1 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 1 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 1 ms 296 KB Output is correct
62 Correct 1 ms 296 KB Output is correct
63 Correct 1 ms 212 KB Output is correct
64 Correct 1 ms 212 KB Output is correct
65 Correct 3 ms 596 KB Output is correct
66 Correct 2 ms 596 KB Output is correct
67 Correct 2 ms 572 KB Output is correct
68 Correct 3 ms 596 KB Output is correct
69 Correct 3 ms 596 KB Output is correct
70 Correct 2 ms 596 KB Output is correct
71 Correct 2 ms 612 KB Output is correct
72 Correct 2 ms 468 KB Output is correct
73 Correct 2 ms 576 KB Output is correct
74 Correct 2 ms 468 KB Output is correct
75 Correct 2 ms 468 KB Output is correct
76 Correct 2 ms 596 KB Output is correct
77 Correct 2 ms 596 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 39 ms 6216 KB Output is correct
80 Correct 39 ms 5956 KB Output is correct
81 Correct 33 ms 6424 KB Output is correct
82 Correct 37 ms 7020 KB Output is correct
83 Correct 35 ms 7084 KB Output is correct
84 Correct 29 ms 5712 KB Output is correct
85 Correct 29 ms 5704 KB Output is correct
86 Correct 29 ms 7508 KB Output is correct
87 Correct 26 ms 5188 KB Output is correct
88 Correct 38 ms 5952 KB Output is correct
89 Correct 39 ms 6348 KB Output is correct
90 Correct 38 ms 5936 KB Output is correct
91 Correct 29 ms 6476 KB Output is correct
92 Correct 23 ms 5964 KB Output is correct
93 Correct 35 ms 7256 KB Output is correct
94 Correct 30 ms 5968 KB Output is correct
95 Correct 29 ms 5572 KB Output is correct
96 Correct 32 ms 6992 KB Output is correct
97 Correct 30 ms 7396 KB Output is correct
98 Correct 32 ms 6724 KB Output is correct
99 Correct 1 ms 212 KB Output is correct
100 Correct 1 ms 212 KB Output is correct
101 Correct 1 ms 304 KB Output is correct
102 Correct 1 ms 340 KB Output is correct
103 Correct 1 ms 340 KB Output is correct
104 Correct 1 ms 212 KB Output is correct
105 Correct 1 ms 340 KB Output is correct
106 Correct 1 ms 340 KB Output is correct
107 Correct 1 ms 340 KB Output is correct
108 Correct 1 ms 340 KB Output is correct
109 Correct 1 ms 212 KB Output is correct
110 Correct 0 ms 212 KB Output is correct
111 Correct 252 ms 34776 KB Output is correct
112 Correct 244 ms 32700 KB Output is correct
113 Correct 207 ms 33956 KB Output is correct
114 Correct 171 ms 35648 KB Output is correct
115 Correct 218 ms 33528 KB Output is correct
116 Correct 270 ms 45604 KB Output is correct
117 Correct 213 ms 34144 KB Output is correct
118 Correct 2 ms 596 KB Output is correct
119 Correct 3 ms 612 KB Output is correct
120 Correct 2 ms 596 KB Output is correct
121 Correct 3 ms 596 KB Output is correct
122 Correct 2 ms 596 KB Output is correct
123 Correct 2 ms 596 KB Output is correct
124 Correct 3 ms 596 KB Output is correct
125 Correct 2 ms 468 KB Output is correct
126 Correct 2 ms 460 KB Output is correct
127 Correct 2 ms 468 KB Output is correct
128 Correct 2 ms 468 KB Output is correct
129 Correct 2 ms 596 KB Output is correct
130 Correct 2 ms 596 KB Output is correct
131 Correct 0 ms 212 KB Output is correct
132 Correct 38 ms 6216 KB Output is correct
133 Correct 38 ms 5940 KB Output is correct
134 Correct 32 ms 6468 KB Output is correct
135 Correct 36 ms 6980 KB Output is correct
136 Correct 35 ms 7104 KB Output is correct
137 Correct 29 ms 5712 KB Output is correct
138 Correct 29 ms 5704 KB Output is correct
139 Correct 31 ms 7484 KB Output is correct
140 Correct 26 ms 5196 KB Output is correct
141 Correct 38 ms 5932 KB Output is correct
142 Correct 39 ms 6216 KB Output is correct
143 Correct 39 ms 5924 KB Output is correct
144 Correct 33 ms 6464 KB Output is correct
145 Correct 24 ms 5948 KB Output is correct
146 Correct 35 ms 7212 KB Output is correct
147 Correct 31 ms 5952 KB Output is correct
148 Correct 30 ms 5532 KB Output is correct
149 Correct 34 ms 7108 KB Output is correct
150 Correct 33 ms 7376 KB Output is correct
151 Correct 33 ms 6720 KB Output is correct
152 Correct 1016 ms 138388 KB Output is correct
153 Correct 979 ms 141144 KB Output is correct
154 Correct 986 ms 135612 KB Output is correct
155 Correct 870 ms 146864 KB Output is correct
156 Correct 681 ms 141424 KB Output is correct
157 Correct 907 ms 127836 KB Output is correct
158 Correct 867 ms 136752 KB Output is correct
159 Correct 923 ms 163560 KB Output is correct
160 Correct 893 ms 157584 KB Output is correct
161 Correct 830 ms 120888 KB Output is correct
162 Correct 873 ms 122948 KB Output is correct