#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
int min_cardinality(int N)
{
// Find the number of different insect types:
// Maximum number of insects with 1 being maximum
// Let that number be K
// Find another set of K numbers with 2 being the maximum
// Then 3 and 4 and so on untill it is no longer possible
// The grader is not adaptive:
vector<int> indicies(N);
iota(indicies.begin(), indicies.end(), 0);
vector<int> in(N);
int k = 0;
for (int i = 0; i < N; i++)
{
move_inside(indicies[i]);
if (press_button() > 1)
{
move_outside(indicies[i]);
}
else
{
k++;
in[i] = 1;
}
}
int res = 1;
while (true)
{
int cnt = 0;
for (int i = 0; i < N && cnt < k; i++)
{
if (in[i]) continue;
move_inside(indicies[i]);
if (press_button() > res + 1)
{
move_outside(indicies[i]);
}
else
{
cnt++;
in[i] = 1;
}
}
if (cnt < k)
return res;
res++;
}
return res;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
2 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
4 ms |
344 KB |
Output is correct |
9 |
Correct |
3 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
344 KB |
Output is correct |
11 |
Correct |
2 ms |
344 KB |
Output is correct |
12 |
Correct |
3 ms |
344 KB |
Output is correct |
13 |
Correct |
2 ms |
344 KB |
Output is correct |
14 |
Correct |
9 ms |
344 KB |
Output is correct |
15 |
Correct |
4 ms |
344 KB |
Output is correct |
16 |
Correct |
5 ms |
344 KB |
Output is correct |
17 |
Correct |
6 ms |
344 KB |
Output is correct |
18 |
Correct |
2 ms |
344 KB |
Output is correct |
19 |
Correct |
3 ms |
344 KB |
Output is correct |
20 |
Correct |
2 ms |
344 KB |
Output is correct |
21 |
Correct |
2 ms |
344 KB |
Output is correct |
22 |
Correct |
2 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
2 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
4 ms |
344 KB |
Output is correct |
9 |
Correct |
3 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
344 KB |
Output is correct |
11 |
Correct |
2 ms |
344 KB |
Output is correct |
12 |
Correct |
3 ms |
344 KB |
Output is correct |
13 |
Correct |
2 ms |
344 KB |
Output is correct |
14 |
Correct |
9 ms |
344 KB |
Output is correct |
15 |
Correct |
4 ms |
344 KB |
Output is correct |
16 |
Correct |
5 ms |
344 KB |
Output is correct |
17 |
Correct |
6 ms |
344 KB |
Output is correct |
18 |
Correct |
2 ms |
344 KB |
Output is correct |
19 |
Correct |
3 ms |
344 KB |
Output is correct |
20 |
Correct |
2 ms |
344 KB |
Output is correct |
21 |
Correct |
2 ms |
344 KB |
Output is correct |
22 |
Correct |
2 ms |
344 KB |
Output is correct |
23 |
Correct |
12 ms |
344 KB |
Output is correct |
24 |
Correct |
7 ms |
344 KB |
Output is correct |
25 |
Correct |
36 ms |
344 KB |
Output is correct |
26 |
Correct |
41 ms |
344 KB |
Output is correct |
27 |
Correct |
12 ms |
344 KB |
Output is correct |
28 |
Correct |
6 ms |
344 KB |
Output is correct |
29 |
Correct |
15 ms |
344 KB |
Output is correct |
30 |
Correct |
13 ms |
344 KB |
Output is correct |
31 |
Correct |
59 ms |
344 KB |
Output is correct |
32 |
Correct |
76 ms |
344 KB |
Output is correct |
33 |
Correct |
76 ms |
344 KB |
Output is correct |
34 |
Correct |
44 ms |
344 KB |
Output is correct |
35 |
Correct |
43 ms |
344 KB |
Output is correct |
36 |
Correct |
43 ms |
344 KB |
Output is correct |
37 |
Correct |
25 ms |
344 KB |
Output is correct |
38 |
Correct |
15 ms |
344 KB |
Output is correct |
39 |
Correct |
11 ms |
344 KB |
Output is correct |
40 |
Correct |
7 ms |
344 KB |
Output is correct |
41 |
Correct |
8 ms |
344 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
344 KB |
Output is correct |
3 |
Correct |
0 ms |
344 KB |
Output is correct |
4 |
Correct |
0 ms |
344 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
20 ms |
344 KB |
Output is correct |
8 |
Correct |
10 ms |
344 KB |
Output is correct |
9 |
Partially correct |
96 ms |
344 KB |
Output is partially correct |
10 |
Partially correct |
102 ms |
344 KB |
Output is partially correct |
11 |
Correct |
27 ms |
344 KB |
Output is correct |
12 |
Correct |
14 ms |
344 KB |
Output is correct |
13 |
Correct |
29 ms |
344 KB |
Output is correct |
14 |
Correct |
21 ms |
344 KB |
Output is correct |
15 |
Partially correct |
196 ms |
340 KB |
Output is partially correct |
16 |
Partially correct |
204 ms |
344 KB |
Output is partially correct |
17 |
Partially correct |
153 ms |
340 KB |
Output is partially correct |
18 |
Partially correct |
196 ms |
344 KB |
Output is partially correct |
19 |
Partially correct |
154 ms |
344 KB |
Output is partially correct |
20 |
Partially correct |
134 ms |
344 KB |
Output is partially correct |
21 |
Partially correct |
95 ms |
344 KB |
Output is partially correct |
22 |
Partially correct |
67 ms |
344 KB |
Output is partially correct |
23 |
Correct |
22 ms |
344 KB |
Output is correct |
24 |
Correct |
32 ms |
344 KB |
Output is correct |
25 |
Correct |
17 ms |
344 KB |
Output is correct |
26 |
Correct |
11 ms |
344 KB |
Output is correct |
27 |
Partially correct |
76 ms |
344 KB |
Output is partially correct |
28 |
Correct |
17 ms |
344 KB |
Output is correct |
29 |
Partially correct |
122 ms |
344 KB |
Output is partially correct |
30 |
Incorrect |
262 ms |
344 KB |
Too many queries. |
31 |
Halted |
0 ms |
0 KB |
- |