#include "insects.h"
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define ar array
#define all(x) x.begin(), x.end()
template <class F, class S>
bool chmin(F &u, const S &v){
bool flag = false;
if ( u > v ){
u = v; flag |= true;
}
return flag;
}
struct Dsu{
vector <int> fa;
int n;
Dsu(int n) : n(n) {
fa.resize(n);
iota(all(fa), 0);
}
int get(int x){
return fa[x] ^ x ? fa[x] = get(fa[x]) : x;
}
bool merge(int u, int v){
u = get(u), v = get(v);
if ( u == v ) return false;
fa[v] = u;
return true;
}
};
const int C = 40;
int min_cardinality(int n) {
vector <int> p;
for ( int i = 0; i < n; i++ ){
move_inside(i);
if ( press_button() == 1 ){
p.pb(i);
} else{
move_outside(i);
}
}
if ( (int)p.size() >= C ){
int cnt = 0;
vector <int> us(n);
while ( !*min_element(all(us)) ){
cnt += 1;
int lst = (int)p.size();
for ( auto &j: p ){
us[j] = 1;
move_outside(j);
} p.clear();
for ( int i = 0; i < n; i++ ){
if ( us[i] ) continue;
move_inside(i);
if ( press_button() == 1 ){
p.pb(i);
} else{
move_outside(i);
}
}
if ( (int)p.size() != lst ){
break;
}
}
return cnt;
} else{
vector <int> us(n);
for ( auto &j: p ){
move_outside(j);
} p.clear();
vector <int> f;
while ( !*min_element(all(us)) ){
int cnt = 0;
for ( int i = 0; i < n; i++ ){
if ( us[i] ) continue;
move_inside(i);
if ( press_button() == cnt + 1 ){
cnt += 1; p.pb(i);
} else{
move_outside(i);
}
}
f.pb(cnt);
for ( auto &x: p ){
us[x] = 1;
move_outside(x);
} p.clear();
}
return *min_element(all(f));
}
}
| # |
Verdict |
Execution time |
Memory |
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 |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
2 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
436 KB |
Output is correct |
| 8 |
Correct |
8 ms |
344 KB |
Output is correct |
| 9 |
Correct |
4 ms |
344 KB |
Output is correct |
| 10 |
Correct |
3 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
3 ms |
344 KB |
Output is correct |
| 13 |
Correct |
4 ms |
344 KB |
Output is correct |
| 14 |
Correct |
6 ms |
344 KB |
Output is correct |
| 15 |
Correct |
4 ms |
344 KB |
Output is correct |
| 16 |
Correct |
5 ms |
344 KB |
Output is correct |
| 17 |
Correct |
6 ms |
344 KB |
Output is correct |
| 18 |
Correct |
10 ms |
344 KB |
Output is correct |
| 19 |
Correct |
8 ms |
344 KB |
Output is correct |
| 20 |
Correct |
2 ms |
344 KB |
Output is correct |
| 21 |
Correct |
2 ms |
344 KB |
Output is correct |
| 22 |
Correct |
2 ms |
436 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
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 |
0 ms |
344 KB |
Output is correct |
| 5 |
Correct |
1 ms |
344 KB |
Output is correct |
| 6 |
Correct |
2 ms |
344 KB |
Output is correct |
| 7 |
Correct |
1 ms |
436 KB |
Output is correct |
| 8 |
Correct |
8 ms |
344 KB |
Output is correct |
| 9 |
Correct |
4 ms |
344 KB |
Output is correct |
| 10 |
Correct |
3 ms |
344 KB |
Output is correct |
| 11 |
Correct |
1 ms |
344 KB |
Output is correct |
| 12 |
Correct |
3 ms |
344 KB |
Output is correct |
| 13 |
Correct |
4 ms |
344 KB |
Output is correct |
| 14 |
Correct |
6 ms |
344 KB |
Output is correct |
| 15 |
Correct |
4 ms |
344 KB |
Output is correct |
| 16 |
Correct |
5 ms |
344 KB |
Output is correct |
| 17 |
Correct |
6 ms |
344 KB |
Output is correct |
| 18 |
Correct |
10 ms |
344 KB |
Output is correct |
| 19 |
Correct |
8 ms |
344 KB |
Output is correct |
| 20 |
Correct |
2 ms |
344 KB |
Output is correct |
| 21 |
Correct |
2 ms |
344 KB |
Output is correct |
| 22 |
Correct |
2 ms |
436 KB |
Output is correct |
| 23 |
Correct |
7 ms |
344 KB |
Output is correct |
| 24 |
Correct |
5 ms |
440 KB |
Output is correct |
| 25 |
Correct |
87 ms |
340 KB |
Output is correct |
| 26 |
Correct |
70 ms |
344 KB |
Output is correct |
| 27 |
Correct |
13 ms |
344 KB |
Output is correct |
| 28 |
Correct |
7 ms |
440 KB |
Output is correct |
| 29 |
Correct |
14 ms |
436 KB |
Output is correct |
| 30 |
Correct |
70 ms |
344 KB |
Output is correct |
| 31 |
Correct |
15 ms |
600 KB |
Output is correct |
| 32 |
Correct |
21 ms |
416 KB |
Output is correct |
| 33 |
Correct |
22 ms |
344 KB |
Output is correct |
| 34 |
Correct |
38 ms |
600 KB |
Output is correct |
| 35 |
Correct |
49 ms |
600 KB |
Output is correct |
| 36 |
Correct |
54 ms |
600 KB |
Output is correct |
| 37 |
Correct |
36 ms |
600 KB |
Output is correct |
| 38 |
Correct |
21 ms |
436 KB |
Output is correct |
| 39 |
Correct |
5 ms |
856 KB |
Output is correct |
| 40 |
Correct |
9 ms |
436 KB |
Output is correct |
| 41 |
Correct |
6 ms |
600 KB |
Output is correct |
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
340 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 |
16 ms |
436 KB |
Output is correct |
| 8 |
Correct |
8 ms |
344 KB |
Output is correct |
| 9 |
Incorrect |
210 ms |
344 KB |
Too many queries. |
| 10 |
Halted |
0 ms |
0 KB |
- |
