#include <iostream>
#include <unordered_set>
using namespace std;
void move_inside(int i);
void move_outside(int i);
int press_button();
int min_cardinality(int N){
int res = 2000;
unordered_set<int> ins;
for (int i=0; i<N; i++) ins.insert(i);
while (!ins.empty()){
unordered_set<int> nins;
int r = 1;
int b = -1;
for (auto i: ins){
if (b==-1){
b=i;
move_inside(i);
continue;
}
move_inside(i);
if (press_button() == 2) r++; else nins.insert(i);
move_outside(i);
}
move_outside(b);
res = min(res, r);
ins = nins;
}
return res;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
1 ms |
208 KB |
Output is correct |
6 |
Correct |
2 ms |
208 KB |
Output is correct |
7 |
Correct |
153 ms |
208 KB |
Output is correct |
8 |
Correct |
11 ms |
208 KB |
Output is correct |
9 |
Correct |
12 ms |
208 KB |
Output is correct |
10 |
Correct |
1 ms |
208 KB |
Output is correct |
11 |
Correct |
22 ms |
208 KB |
Output is correct |
12 |
Correct |
5 ms |
208 KB |
Output is correct |
13 |
Correct |
14 ms |
208 KB |
Output is correct |
14 |
Correct |
7 ms |
208 KB |
Output is correct |
15 |
Correct |
8 ms |
308 KB |
Output is correct |
16 |
Correct |
9 ms |
308 KB |
Output is correct |
17 |
Correct |
7 ms |
208 KB |
Output is correct |
18 |
Correct |
11 ms |
208 KB |
Output is correct |
19 |
Correct |
20 ms |
208 KB |
Output is correct |
20 |
Correct |
29 ms |
208 KB |
Output is correct |
21 |
Correct |
54 ms |
312 KB |
Output is correct |
22 |
Correct |
112 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
1 ms |
208 KB |
Output is correct |
6 |
Correct |
2 ms |
208 KB |
Output is correct |
7 |
Correct |
153 ms |
208 KB |
Output is correct |
8 |
Correct |
11 ms |
208 KB |
Output is correct |
9 |
Correct |
12 ms |
208 KB |
Output is correct |
10 |
Correct |
1 ms |
208 KB |
Output is correct |
11 |
Correct |
22 ms |
208 KB |
Output is correct |
12 |
Correct |
5 ms |
208 KB |
Output is correct |
13 |
Correct |
14 ms |
208 KB |
Output is correct |
14 |
Correct |
7 ms |
208 KB |
Output is correct |
15 |
Correct |
8 ms |
308 KB |
Output is correct |
16 |
Correct |
9 ms |
308 KB |
Output is correct |
17 |
Correct |
7 ms |
208 KB |
Output is correct |
18 |
Correct |
11 ms |
208 KB |
Output is correct |
19 |
Correct |
20 ms |
208 KB |
Output is correct |
20 |
Correct |
29 ms |
208 KB |
Output is correct |
21 |
Correct |
54 ms |
312 KB |
Output is correct |
22 |
Correct |
112 ms |
208 KB |
Output is correct |
23 |
Correct |
7 ms |
336 KB |
Output is correct |
24 |
Incorrect |
318 ms |
336 KB |
Too many queries. |
25 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
0 ms |
208 KB |
Output is correct |
4 |
Correct |
0 ms |
208 KB |
Output is correct |
5 |
Correct |
1 ms |
208 KB |
Output is correct |
6 |
Correct |
0 ms |
208 KB |
Output is correct |
7 |
Correct |
20 ms |
336 KB |
Output is correct |
8 |
Incorrect |
283 ms |
404 KB |
Too many queries. |
9 |
Halted |
0 ms |
0 KB |
- |