oj.uz

Submission #722782

# Submission time Handle Problem Language Result Execution time Memory
722782 2023-04-12T20:34:59 Z Johann The short shank; Redemption (BOI21_prison) C++14
100 / 100
 340 ms 153840 KB 
#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define pii pair<int, int>
#define vb vector<bool>
#define vi vector<int>
#define vpii vector<pii>
#define vvb vector<vb>
#define vvi vector<vi>
#define vvpii vector<vpii>
#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()

int N, D, T;
vi P;

vi protest; // state: 0 : never, 1 : save, -1 : changable
vi trigger; // the rightmost prisoner to trigger [i], only for -1

vvi adj; // graph
vi par;  // parent
vi maxSubtree;
vi nodeByLen; // number of nodes with depth [i]

void dfs(int v)
{
    if (maxSubtree[v] == -1)
    {
        if (sz(adj[v]) == 0)
        {
            maxSubtree[v] = 0;
            return;
        }
        for (int u : adj[v])
            dfs(u);
        for (int u : adj[v])
            maxSubtree[v] = max(maxSubtree[v], maxSubtree[u]);
        ++maxSubtree[v];
    }
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    cin >> N >> D >> T;
    D = min(D, N);
    P.resize(N);
    for (int i = 0; i < N; ++i)
        cin >> P[i];

    int ans = 0;
    protest.assign(N, 0);
    trigger.assign(N, -1);
    stack<pii> blockers; // which range is blocked [i, j] inclusive
    for (int i = 0; i < N; ++i)
    {
        if (P[i] <= T)
        {
            protest[i] = 1;
            ++ans;
            blockers.push({i, min(i + T - P[i], N)});
        }
        else
        {
            while (!blockers.empty() && blockers.top().second < i)
                blockers.pop();
            if (!blockers.empty())
                protest[i] = -1, ++ans, trigger[i] = blockers.top().first;
        }
    }

    adj.resize(N);
    par.assign(N, -1);
    stack<int> todo;
    for (int i = N - 1; i >= 0; --i)
    {
        if (protest[i] != -1)
            continue;
        while (!todo.empty() && trigger[todo.top()] > i)
            todo.pop();
        if (!todo.empty())
            adj[todo.top()].push_back(i), par[i] = todo.top();
        todo.push(i);
    }

    maxSubtree.assign(N, -1);
    nodeByLen.assign(N, 0);
    for (int i = 0; i < N; ++i)
        if (protest[i] == -1)
        {
            if (maxSubtree[i] == -1)
                dfs(i);
            ++nodeByLen[maxSubtree[i]];
        }

    int stuff = 0;
    for (int i = N - 1; i >= 0; --i)
    {
        stuff = max(stuff, min(nodeByLen[i], D));
        ans -= stuff;
    }

    cout << ans << endl;

    return 0;
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 79 ms 29680 KB Output is correct
3 Correct 72 ms 28340 KB Output is correct
4 Correct 78 ms 30180 KB Output is correct
5 Correct 73 ms 31564 KB Output is correct
6 Correct 68 ms 27596 KB Output is correct
7 Correct 84 ms 41460 KB Output is correct
8 Correct 87 ms 28256 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 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 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct

Subtask #4
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 14 ms 5004 KB Output is correct
3 Correct 12 ms 4692 KB Output is correct
4 Correct 14 ms 5236 KB Output is correct
5 Correct 13 ms 5588 KB Output is correct
6 Correct 17 ms 5620 KB Output is correct
7 Correct 10 ms 4340 KB Output is correct
8 Correct 10 ms 4412 KB Output is correct
9 Correct 12 ms 6464 KB Output is correct
10 Correct 9 ms 3796 KB Output is correct

Subtask #5
25.0 / 25.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 340 KB Output is correct
15 Correct 1 ms 340 KB Output is correct
16 Correct 0 ms 340 KB Output is correct
17 Correct 0 ms 340 KB Output is correct
18 Correct 0 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 0 ms 340 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 2 ms 468 KB Output is correct
24 Correct 1 ms 468 KB Output is correct
25 Correct 1 ms 468 KB Output is correct
26 Correct 1 ms 468 KB Output is correct
27 Correct 1 ms 468 KB Output is correct
28 Correct 1 ms 468 KB Output is correct
29 Correct 1 ms 468 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 0 ms 212 KB Output is correct
37 Correct 14 ms 5004 KB Output is correct
38 Correct 12 ms 4692 KB Output is correct
39 Correct 14 ms 5236 KB Output is correct
40 Correct 13 ms 5588 KB Output is correct
41 Correct 17 ms 5620 KB Output is correct
42 Correct 10 ms 4340 KB Output is correct
43 Correct 10 ms 4412 KB Output is correct
44 Correct 12 ms 6464 KB Output is correct
45 Correct 9 ms 3796 KB Output is correct
46 Correct 1 ms 212 KB Output is correct
47 Correct 0 ms 340 KB Output is correct
48 Correct 0 ms 340 KB Output is correct
49 Correct 0 ms 340 KB Output is correct
50 Correct 1 ms 340 KB Output is correct
51 Correct 0 ms 340 KB Output is correct
52 Correct 1 ms 340 KB Output is correct
53 Correct 0 ms 340 KB Output is correct
54 Correct 0 ms 340 KB Output is correct
55 Correct 1 ms 340 KB Output is correct
56 Correct 1 ms 384 KB Output is correct
57 Correct 1 ms 468 KB Output is correct
58 Correct 1 ms 468 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 1 ms 468 KB Output is correct
61 Correct 1 ms 468 KB Output is correct
62 Correct 1 ms 468 KB Output is correct
63 Correct 1 ms 468 KB Output is correct
64 Correct 1 ms 468 KB Output is correct
65 Correct 1 ms 468 KB Output is correct
66 Correct 1 ms 468 KB Output is correct
67 Correct 1 ms 468 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 1 ms 468 KB Output is correct
70 Correct 0 ms 212 KB Output is correct
71 Correct 17 ms 4948 KB Output is correct
72 Correct 14 ms 4820 KB Output is correct
73 Correct 12 ms 5204 KB Output is correct
74 Correct 14 ms 5620 KB Output is correct
75 Correct 12 ms 5708 KB Output is correct
76 Correct 10 ms 4344 KB Output is correct
77 Correct 9 ms 4308 KB Output is correct
78 Correct 17 ms 6484 KB Output is correct
79 Correct 8 ms 3796 KB Output is correct
80 Correct 12 ms 4724 KB Output is correct
81 Correct 12 ms 4948 KB Output is correct
82 Correct 12 ms 4692 KB Output is correct
83 Correct 14 ms 5232 KB Output is correct
84 Correct 11 ms 4948 KB Output is correct
85 Correct 15 ms 5752 KB Output is correct
86 Correct 12 ms 4732 KB Output is correct
87 Correct 10 ms 4180 KB Output is correct
88 Correct 11 ms 5908 KB Output is correct
89 Correct 13 ms 6376 KB Output is correct
90 Correct 11 ms 5508 KB Output is correct

Subtask #6
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 0 ms 340 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 340 KB Output is correct
6 Correct 1 ms 340 KB Output is correct
7 Correct 1 ms 340 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 0 ms 340 KB Output is correct
10 Correct 0 ms 340 KB Output is correct
11 Correct 1 ms 340 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 79 ms 29680 KB Output is correct
14 Correct 72 ms 28340 KB Output is correct
15 Correct 78 ms 30180 KB Output is correct
16 Correct 73 ms 31564 KB Output is correct
17 Correct 68 ms 27596 KB Output is correct
18 Correct 84 ms 41460 KB Output is correct
19 Correct 87 ms 28256 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 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 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 2 ms 468 KB Output is correct
32 Correct 1 ms 468 KB Output is correct
33 Correct 1 ms 468 KB Output is correct
34 Correct 1 ms 468 KB Output is correct
35 Correct 1 ms 468 KB Output is correct
36 Correct 1 ms 468 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 468 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 1 ms 468 KB Output is correct
41 Correct 1 ms 468 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 0 ms 212 KB Output is correct
45 Correct 14 ms 5004 KB Output is correct
46 Correct 12 ms 4692 KB Output is correct
47 Correct 14 ms 5236 KB Output is correct
48 Correct 13 ms 5588 KB Output is correct
49 Correct 17 ms 5620 KB Output is correct
50 Correct 10 ms 4340 KB Output is correct
51 Correct 10 ms 4412 KB Output is correct
52 Correct 12 ms 6464 KB Output is correct
53 Correct 9 ms 3796 KB Output is correct
54 Correct 1 ms 212 KB Output is correct
55 Correct 0 ms 340 KB Output is correct
56 Correct 0 ms 340 KB Output is correct
57 Correct 0 ms 340 KB Output is correct
58 Correct 1 ms 340 KB Output is correct
59 Correct 0 ms 340 KB Output is correct
60 Correct 1 ms 340 KB Output is correct
61 Correct 0 ms 340 KB Output is correct
62 Correct 0 ms 340 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 1 ms 384 KB Output is correct
65 Correct 1 ms 468 KB Output is correct
66 Correct 1 ms 468 KB Output is correct
67 Correct 1 ms 468 KB Output is correct
68 Correct 1 ms 468 KB Output is correct
69 Correct 1 ms 468 KB Output is correct
70 Correct 1 ms 468 KB Output is correct
71 Correct 1 ms 468 KB Output is correct
72 Correct 1 ms 468 KB Output is correct
73 Correct 1 ms 468 KB Output is correct
74 Correct 1 ms 468 KB Output is correct
75 Correct 1 ms 468 KB Output is correct
76 Correct 1 ms 468 KB Output is correct
77 Correct 1 ms 468 KB Output is correct
78 Correct 0 ms 212 KB Output is correct
79 Correct 17 ms 4948 KB Output is correct
80 Correct 14 ms 4820 KB Output is correct
81 Correct 12 ms 5204 KB Output is correct
82 Correct 14 ms 5620 KB Output is correct
83 Correct 12 ms 5708 KB Output is correct
84 Correct 10 ms 4344 KB Output is correct
85 Correct 9 ms 4308 KB Output is correct
86 Correct 17 ms 6484 KB Output is correct
87 Correct 8 ms 3796 KB Output is correct
88 Correct 12 ms 4724 KB Output is correct
89 Correct 12 ms 4948 KB Output is correct
90 Correct 12 ms 4692 KB Output is correct
91 Correct 14 ms 5232 KB Output is correct
92 Correct 11 ms 4948 KB Output is correct
93 Correct 15 ms 5752 KB Output is correct
94 Correct 12 ms 4732 KB Output is correct
95 Correct 10 ms 4180 KB Output is correct
96 Correct 11 ms 5908 KB Output is correct
97 Correct 13 ms 6376 KB Output is correct
98 Correct 11 ms 5508 KB Output is correct
99 Correct 1 ms 212 KB Output is correct
100 Correct 1 ms 340 KB Output is correct
101 Correct 0 ms 340 KB Output is correct
102 Correct 1 ms 340 KB Output is correct
103 Correct 0 ms 340 KB Output is correct
104 Correct 1 ms 340 KB Output is correct
105 Correct 1 ms 340 KB Output is correct
106 Correct 0 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 340 KB Output is correct
110 Correct 1 ms 212 KB Output is correct
111 Correct 80 ms 29792 KB Output is correct
112 Correct 73 ms 28268 KB Output is correct
113 Correct 72 ms 30224 KB Output is correct
114 Correct 72 ms 31480 KB Output is correct
115 Correct 70 ms 27500 KB Output is correct
116 Correct 96 ms 41480 KB Output is correct
117 Correct 72 ms 28256 KB Output is correct
118 Correct 1 ms 468 KB Output is correct
119 Correct 1 ms 468 KB Output is correct
120 Correct 1 ms 468 KB Output is correct
121 Correct 1 ms 468 KB Output is correct
122 Correct 2 ms 468 KB Output is correct
123 Correct 1 ms 468 KB Output is correct
124 Correct 1 ms 468 KB Output is correct
125 Correct 1 ms 468 KB Output is correct
126 Correct 1 ms 468 KB Output is correct
127 Correct 1 ms 468 KB Output is correct
128 Correct 1 ms 468 KB Output is correct
129 Correct 1 ms 468 KB Output is correct
130 Correct 1 ms 468 KB Output is correct
131 Correct 0 ms 212 KB Output is correct
132 Correct 12 ms 4904 KB Output is correct
133 Correct 13 ms 4724 KB Output is correct
134 Correct 13 ms 5204 KB Output is correct
135 Correct 12 ms 5636 KB Output is correct
136 Correct 13 ms 5628 KB Output is correct
137 Correct 9 ms 4436 KB Output is correct
138 Correct 11 ms 4344 KB Output is correct
139 Correct 16 ms 6512 KB Output is correct
140 Correct 9 ms 3820 KB Output is correct
141 Correct 12 ms 4668 KB Output is correct
142 Correct 13 ms 4980 KB Output is correct
143 Correct 16 ms 4692 KB Output is correct
144 Correct 11 ms 5204 KB Output is correct
145 Correct 10 ms 4868 KB Output is correct
146 Correct 14 ms 5748 KB Output is correct
147 Correct 10 ms 4692 KB Output is correct
148 Correct 11 ms 4180 KB Output is correct
149 Correct 12 ms 5904 KB Output is correct
150 Correct 13 ms 6292 KB Output is correct
151 Correct 11 ms 5492 KB Output is correct
152 Correct 298 ms 118244 KB Output is correct
153 Correct 302 ms 120416 KB Output is correct
154 Correct 300 ms 116456 KB Output is correct
155 Correct 310 ms 126048 KB Output is correct
156 Correct 340 ms 125384 KB Output is correct
157 Correct 264 ms 102160 KB Output is correct
158 Correct 284 ms 112460 KB Output is correct
159 Correct 324 ms 143568 KB Output is correct
160 Correct 339 ms 153840 KB Output is correct
161 Correct 252 ms 112204 KB Output is correct
162 Correct 255 ms 114372 KB Output is correct