#include "insects.h"
#include "bits/stdc++.h"
#define SZ(s) ((int) s.size())
using namespace std;
int min_cardinality(int n) {
std::vector<int> v_ids(n);
std::iota(v_ids.begin(), v_ids.end(), 0);
std::set<int> ids(v_ids.begin(), v_ids.end());
int freq = 0, last_cnt = 0;
while (true) {
++freq;
std::set<int> new_ids;
for (int id : ids) {
move_inside(id);
if (press_button() > freq) {
move_outside(id);
new_ids.insert(id);
}
}
int unique_values = SZ(ids) - SZ(new_ids);
if (unique_values < last_cnt) {
return freq - 1;
}
last_cnt = unique_values;
if (unique_values > SZ(new_ids)) {
return freq;
}
ids = std::move(new_ids);
}
return 0;
}
# |
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 |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
1 ms |
208 KB |
Output is correct |
6 |
Correct |
212 ms |
208 KB |
Output is correct |
7 |
Correct |
2 ms |
208 KB |
Output is correct |
8 |
Correct |
12 ms |
208 KB |
Output is correct |
9 |
Correct |
7 ms |
316 KB |
Output is correct |
10 |
Correct |
5 ms |
320 KB |
Output is correct |
11 |
Correct |
2 ms |
208 KB |
Output is correct |
12 |
Correct |
6 ms |
208 KB |
Output is correct |
13 |
Correct |
4 ms |
208 KB |
Output is correct |
14 |
Correct |
36 ms |
208 KB |
Output is correct |
15 |
Correct |
16 ms |
208 KB |
Output is correct |
16 |
Correct |
23 ms |
208 KB |
Output is correct |
17 |
Correct |
17 ms |
308 KB |
Output is correct |
18 |
Correct |
6 ms |
308 KB |
Output is correct |
19 |
Correct |
7 ms |
208 KB |
Output is correct |
20 |
Correct |
4 ms |
208 KB |
Output is correct |
21 |
Correct |
1 ms |
208 KB |
Output is correct |
22 |
Correct |
3 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 |
1 ms |
208 KB |
Output is correct |
5 |
Correct |
1 ms |
208 KB |
Output is correct |
6 |
Correct |
212 ms |
208 KB |
Output is correct |
7 |
Correct |
2 ms |
208 KB |
Output is correct |
8 |
Correct |
12 ms |
208 KB |
Output is correct |
9 |
Correct |
7 ms |
316 KB |
Output is correct |
10 |
Correct |
5 ms |
320 KB |
Output is correct |
11 |
Correct |
2 ms |
208 KB |
Output is correct |
12 |
Correct |
6 ms |
208 KB |
Output is correct |
13 |
Correct |
4 ms |
208 KB |
Output is correct |
14 |
Correct |
36 ms |
208 KB |
Output is correct |
15 |
Correct |
16 ms |
208 KB |
Output is correct |
16 |
Correct |
23 ms |
208 KB |
Output is correct |
17 |
Correct |
17 ms |
308 KB |
Output is correct |
18 |
Correct |
6 ms |
308 KB |
Output is correct |
19 |
Correct |
7 ms |
208 KB |
Output is correct |
20 |
Correct |
4 ms |
208 KB |
Output is correct |
21 |
Correct |
1 ms |
208 KB |
Output is correct |
22 |
Correct |
3 ms |
208 KB |
Output is correct |
23 |
Incorrect |
368 ms |
368 KB |
Too many queries. |
24 |
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 |
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 |
1 ms |
208 KB |
Output is correct |
7 |
Incorrect |
279 ms |
416 KB |
Too many queries. |
8 |
Halted |
0 ms |
0 KB |
- |