#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
#define rall(s) s.rbegin(), s.rend()
#define all(s) s.begin(), s.end()
#define sz(s) (int) s.size()
#define s second
#define f first
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
mt19937_64 rng(131415889);
int min_cardinality(int n) {
vector<pair<int, vector<int>>> s;
vector<int> p(n);
for (int i = 0; i < n; i++) p[i] = i;
shuffle(all(p), rng);
s.push_back({1, {p[0]}});
move_inside(p[0]);
for (int i = 1; i < n; i++) {
move_inside(p[i]);
if (press_button() > 1) {
bool ok = 0;
sort(rall(s));
for (int j = 0; j < sz(s); j++) {
move_outside(s[j].s.back());
if (press_button() == 1) {
s[j].s.push_back(p[i]);
s[j].f++;
ok = 1;
break;
}
move_inside(s[j].s.back());
}
if (!ok) move_outside(p[i]);
continue;
}
s.push_back({1, {p[i]}});
}
sort(all(s));
return s[0].f;
}
# |
Verdict |
Execution time |
Memory |
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 |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
3 ms |
344 KB |
Output is correct |
7 |
Correct |
2 ms |
344 KB |
Output is correct |
8 |
Correct |
10 ms |
344 KB |
Output is correct |
9 |
Correct |
10 ms |
344 KB |
Output is correct |
10 |
Correct |
3 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 |
8 ms |
344 KB |
Output is correct |
14 |
Correct |
5 ms |
344 KB |
Output is correct |
15 |
Correct |
7 ms |
344 KB |
Output is correct |
16 |
Correct |
6 ms |
344 KB |
Output is correct |
17 |
Correct |
5 ms |
344 KB |
Output is correct |
18 |
Correct |
9 ms |
344 KB |
Output is correct |
19 |
Correct |
7 ms |
344 KB |
Output is correct |
20 |
Correct |
13 ms |
344 KB |
Output is correct |
21 |
Correct |
24 ms |
344 KB |
Output is correct |
22 |
Correct |
19 ms |
344 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
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 |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
3 ms |
344 KB |
Output is correct |
7 |
Correct |
2 ms |
344 KB |
Output is correct |
8 |
Correct |
10 ms |
344 KB |
Output is correct |
9 |
Correct |
10 ms |
344 KB |
Output is correct |
10 |
Correct |
3 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 |
8 ms |
344 KB |
Output is correct |
14 |
Correct |
5 ms |
344 KB |
Output is correct |
15 |
Correct |
7 ms |
344 KB |
Output is correct |
16 |
Correct |
6 ms |
344 KB |
Output is correct |
17 |
Correct |
5 ms |
344 KB |
Output is correct |
18 |
Correct |
9 ms |
344 KB |
Output is correct |
19 |
Correct |
7 ms |
344 KB |
Output is correct |
20 |
Correct |
13 ms |
344 KB |
Output is correct |
21 |
Correct |
24 ms |
344 KB |
Output is correct |
22 |
Correct |
19 ms |
344 KB |
Output is correct |
23 |
Correct |
10 ms |
600 KB |
Output is correct |
24 |
Correct |
5 ms |
600 KB |
Output is correct |
25 |
Correct |
95 ms |
600 KB |
Output is correct |
26 |
Correct |
75 ms |
424 KB |
Output is correct |
27 |
Correct |
12 ms |
344 KB |
Output is correct |
28 |
Correct |
11 ms |
344 KB |
Output is correct |
29 |
Correct |
24 ms |
344 KB |
Output is correct |
30 |
Correct |
107 ms |
1104 KB |
Output is correct |
31 |
Correct |
16 ms |
344 KB |
Output is correct |
32 |
Correct |
25 ms |
676 KB |
Output is correct |
33 |
Correct |
31 ms |
848 KB |
Output is correct |
34 |
Correct |
28 ms |
592 KB |
Output is correct |
35 |
Correct |
45 ms |
592 KB |
Output is correct |
36 |
Correct |
49 ms |
424 KB |
Output is correct |
37 |
Correct |
127 ms |
436 KB |
Output is correct |
38 |
Incorrect |
249 ms |
428 KB |
Too many queries. |
39 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
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 |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
26 ms |
344 KB |
Output is correct |
8 |
Correct |
10 ms |
760 KB |
Output is correct |
9 |
Incorrect |
231 ms |
432 KB |
Too many queries. |
10 |
Halted |
0 ms |
0 KB |
- |