#include <bits/stdc++.h>
#include "insects.h"
using namespace std;
typedef long long ll;
void move_inside(int i);
void move_outside(int i);
int press_button();
int min_cardinality(int n){
vector<ll> v(n, -1);
v[0]=0;
ll l=1;
for(ll i=1; i<n; i++){
move_inside(i);
for(ll j=0; j<i; j++){
move_inside(j);
ll k=press_button();
move_outside(j);
if(k==2) {
v[i]=v[j];
break;
}
}
move_outside(i);
if(v[i]==-1) {
v[i]=l;
l++;
}
}
vector<ll> c(n, 0);
for(ll i=0; i<n; i++){
c[v[i]]++;
}
ll mn=0;
for(ll i=0; i<n; i++){
if(c[mn]>c[i] && c[i]!=0) mn=i;
}
return c[mn];
}
# |
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 |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
3 ms |
208 KB |
Output is correct |
7 |
Correct |
108 ms |
276 KB |
Output is correct |
8 |
Correct |
20 ms |
288 KB |
Output is correct |
9 |
Correct |
13 ms |
292 KB |
Output is correct |
10 |
Correct |
4 ms |
208 KB |
Output is correct |
11 |
Correct |
98 ms |
280 KB |
Output is correct |
12 |
Correct |
7 ms |
320 KB |
Output is correct |
13 |
Correct |
25 ms |
276 KB |
Output is correct |
14 |
Correct |
5 ms |
208 KB |
Output is correct |
15 |
Correct |
19 ms |
292 KB |
Output is correct |
16 |
Correct |
17 ms |
328 KB |
Output is correct |
17 |
Correct |
24 ms |
280 KB |
Output is correct |
18 |
Correct |
20 ms |
208 KB |
Output is correct |
19 |
Correct |
21 ms |
280 KB |
Output is correct |
20 |
Correct |
75 ms |
276 KB |
Output is correct |
21 |
Correct |
105 ms |
280 KB |
Output is correct |
22 |
Correct |
168 ms |
284 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 |
0 ms |
208 KB |
Output is correct |
6 |
Correct |
3 ms |
208 KB |
Output is correct |
7 |
Correct |
108 ms |
276 KB |
Output is correct |
8 |
Correct |
20 ms |
288 KB |
Output is correct |
9 |
Correct |
13 ms |
292 KB |
Output is correct |
10 |
Correct |
4 ms |
208 KB |
Output is correct |
11 |
Correct |
98 ms |
280 KB |
Output is correct |
12 |
Correct |
7 ms |
320 KB |
Output is correct |
13 |
Correct |
25 ms |
276 KB |
Output is correct |
14 |
Correct |
5 ms |
208 KB |
Output is correct |
15 |
Correct |
19 ms |
292 KB |
Output is correct |
16 |
Correct |
17 ms |
328 KB |
Output is correct |
17 |
Correct |
24 ms |
280 KB |
Output is correct |
18 |
Correct |
20 ms |
208 KB |
Output is correct |
19 |
Correct |
21 ms |
280 KB |
Output is correct |
20 |
Correct |
75 ms |
276 KB |
Output is correct |
21 |
Correct |
105 ms |
280 KB |
Output is correct |
22 |
Correct |
168 ms |
284 KB |
Output is correct |
23 |
Correct |
9 ms |
284 KB |
Output is correct |
24 |
Incorrect |
354 ms |
208 KB |
Too many queries. |
25 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
208 KB |
Output is correct |
2 |
Correct |
1 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 |
0 ms |
208 KB |
Output is correct |
7 |
Correct |
9 ms |
304 KB |
Output is correct |
8 |
Incorrect |
234 ms |
208 KB |
Too many queries. |
9 |
Halted |
0 ms |
0 KB |
- |