// protocol_violation/solution-o-n-d.cpp
#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
int min_cardinality(int N) {
int ans = N;
vector <int> insects(N);
iota(insects.begin(), insects.end(), 0);
while (!insects.empty()) {
int cnt = 1;
vector <int> next;
move_inside(insects[0]);
for (int i = 1; i < (int)insects.size(); i++) {
move_inside(insects[i]);
if (press_button() == 2) {
cnt++;
}
else {
next.push_back(insects[i]);
}
move_outside(insects[i]);
}
move_outside(insects[0]);
insects = next;
ans = min(ans,cnt);
}
return ans;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
208 KB |
Output is correct |
3 |
Correct |
1 ms |
208 KB |
Output is correct |
4 |
Correct |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
1 ms |
256 KB |
Output is correct |
6 |
Correct |
2 ms |
208 KB |
Output is correct |
7 |
Correct |
158 ms |
208 KB |
Output is correct |
8 |
Correct |
17 ms |
220 KB |
Output is correct |
9 |
Correct |
14 ms |
228 KB |
Output is correct |
10 |
Correct |
8 ms |
300 KB |
Output is correct |
11 |
Correct |
23 ms |
208 KB |
Output is correct |
12 |
Correct |
3 ms |
208 KB |
Output is correct |
13 |
Correct |
6 ms |
208 KB |
Output is correct |
14 |
Correct |
7 ms |
296 KB |
Output is correct |
15 |
Correct |
8 ms |
208 KB |
Output is correct |
16 |
Correct |
8 ms |
296 KB |
Output is correct |
17 |
Correct |
12 ms |
296 KB |
Output is correct |
18 |
Correct |
15 ms |
304 KB |
Output is correct |
19 |
Correct |
12 ms |
304 KB |
Output is correct |
20 |
Correct |
47 ms |
208 KB |
Output is correct |
21 |
Correct |
93 ms |
208 KB |
Output is correct |
22 |
Correct |
87 ms |
208 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
1 ms |
208 KB |
Output is correct |
3 |
Correct |
1 ms |
208 KB |
Output is correct |
4 |
Correct |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
1 ms |
256 KB |
Output is correct |
6 |
Correct |
2 ms |
208 KB |
Output is correct |
7 |
Correct |
158 ms |
208 KB |
Output is correct |
8 |
Correct |
17 ms |
220 KB |
Output is correct |
9 |
Correct |
14 ms |
228 KB |
Output is correct |
10 |
Correct |
8 ms |
300 KB |
Output is correct |
11 |
Correct |
23 ms |
208 KB |
Output is correct |
12 |
Correct |
3 ms |
208 KB |
Output is correct |
13 |
Correct |
6 ms |
208 KB |
Output is correct |
14 |
Correct |
7 ms |
296 KB |
Output is correct |
15 |
Correct |
8 ms |
208 KB |
Output is correct |
16 |
Correct |
8 ms |
296 KB |
Output is correct |
17 |
Correct |
12 ms |
296 KB |
Output is correct |
18 |
Correct |
15 ms |
304 KB |
Output is correct |
19 |
Correct |
12 ms |
304 KB |
Output is correct |
20 |
Correct |
47 ms |
208 KB |
Output is correct |
21 |
Correct |
93 ms |
208 KB |
Output is correct |
22 |
Correct |
87 ms |
208 KB |
Output is correct |
23 |
Correct |
5 ms |
208 KB |
Output is correct |
24 |
Incorrect |
386 ms |
208 KB |
Too many queries. |
25 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
208 KB |
Output is correct |
2 |
Correct |
0 ms |
208 KB |
Output is correct |
3 |
Correct |
1 ms |
208 KB |
Output is correct |
4 |
Correct |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
0 ms |
208 KB |
Output is correct |
7 |
Correct |
17 ms |
208 KB |
Output is correct |
8 |
Incorrect |
464 ms |
208 KB |
Too many queries. |
9 |
Halted |
0 ms |
0 KB |
- |