#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>;
int min_cardinality(int n) {
vector<pair<int, vector<int>>> s;
s.push_back({1, {0}});
move_inside(0);
for (int i = 1; i < n; i++) {
move_inside(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(i);
s[j].f++;
ok = 1;
break;
}
move_inside(s[j].s.back());
}
if (!ok) move_outside(i);
continue;
}
s.push_back({1, {i}});
}
sort(all(s));
return s[0].f;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
2 ms |
436 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
7 ms |
344 KB |
Output is correct |
9 |
Correct |
4 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
600 KB |
Output is correct |
11 |
Correct |
2 ms |
436 KB |
Output is correct |
12 |
Correct |
4 ms |
344 KB |
Output is correct |
13 |
Correct |
9 ms |
436 KB |
Output is correct |
14 |
Correct |
5 ms |
396 KB |
Output is correct |
15 |
Correct |
5 ms |
344 KB |
Output is correct |
16 |
Correct |
6 ms |
344 KB |
Output is correct |
17 |
Correct |
7 ms |
344 KB |
Output is correct |
18 |
Correct |
8 ms |
436 KB |
Output is correct |
19 |
Correct |
9 ms |
344 KB |
Output is correct |
20 |
Correct |
23 ms |
428 KB |
Output is correct |
21 |
Correct |
17 ms |
596 KB |
Output is correct |
22 |
Correct |
14 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 |
1 ms |
344 KB |
Output is correct |
5 |
Correct |
0 ms |
344 KB |
Output is correct |
6 |
Correct |
2 ms |
436 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
7 ms |
344 KB |
Output is correct |
9 |
Correct |
4 ms |
344 KB |
Output is correct |
10 |
Correct |
2 ms |
600 KB |
Output is correct |
11 |
Correct |
2 ms |
436 KB |
Output is correct |
12 |
Correct |
4 ms |
344 KB |
Output is correct |
13 |
Correct |
9 ms |
436 KB |
Output is correct |
14 |
Correct |
5 ms |
396 KB |
Output is correct |
15 |
Correct |
5 ms |
344 KB |
Output is correct |
16 |
Correct |
6 ms |
344 KB |
Output is correct |
17 |
Correct |
7 ms |
344 KB |
Output is correct |
18 |
Correct |
8 ms |
436 KB |
Output is correct |
19 |
Correct |
9 ms |
344 KB |
Output is correct |
20 |
Correct |
23 ms |
428 KB |
Output is correct |
21 |
Correct |
17 ms |
596 KB |
Output is correct |
22 |
Correct |
14 ms |
344 KB |
Output is correct |
23 |
Correct |
8 ms |
344 KB |
Output is correct |
24 |
Correct |
6 ms |
1112 KB |
Output is correct |
25 |
Correct |
98 ms |
420 KB |
Output is correct |
26 |
Correct |
96 ms |
416 KB |
Output is correct |
27 |
Correct |
8 ms |
344 KB |
Output is correct |
28 |
Correct |
10 ms |
344 KB |
Output is correct |
29 |
Correct |
16 ms |
344 KB |
Output is correct |
30 |
Correct |
89 ms |
436 KB |
Output is correct |
31 |
Correct |
22 ms |
672 KB |
Output is correct |
32 |
Correct |
22 ms |
672 KB |
Output is correct |
33 |
Correct |
23 ms |
344 KB |
Output is correct |
34 |
Correct |
44 ms |
420 KB |
Output is correct |
35 |
Correct |
40 ms |
420 KB |
Output is correct |
36 |
Correct |
62 ms |
848 KB |
Output is correct |
37 |
Correct |
137 ms |
420 KB |
Output is correct |
38 |
Incorrect |
228 ms |
600 KB |
Too many queries. |
39 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
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 |
24 ms |
600 KB |
Output is correct |
8 |
Correct |
8 ms |
600 KB |
Output is correct |
9 |
Incorrect |
273 ms |
676 KB |
Too many queries. |
10 |
Halted |
0 ms |
0 KB |
- |