#include "insects.h"
int state[2001],a[2001],cnt,cur;
int min_cardinality(int n){
for (int i=0;i<n;i++){
move_inside(i);
state[i]=1;
a[i]=press_button();
if (a[i]>1){
move_outside(i);
state[i]=0;
}
else
cnt++;
}
cur=cnt;
int l=2,r=n/cnt,kq=1;
while (l<=r){
int mid=(l+r)>>1;
for (int i=0;i<n;i++)
if (state[i]&&a[i]>mid){
move_outside(i);
cur--;
state[i]=0;
}
for (int i=0;i<n;i++){
if (state[i]||a[i]>mid)
continue;
move_inside(i);
a[i]=press_button();
if (a[i]>mid)
move_outside(i);
else{
cur++;
state[i]=1;
}
}
if (cur==mid*cnt){
kq=mid;
l=mid+1;
}
else
r=mid-1;
}
return kq;
}
# |
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 |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
2 ms |
344 KB |
Output is correct |
9 |
Incorrect |
2 ms |
344 KB |
Wrong answer. |
10 |
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 |
3 ms |
344 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
2 ms |
344 KB |
Output is correct |
9 |
Incorrect |
2 ms |
344 KB |
Wrong answer. |
10 |
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 |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
344 KB |
Output is correct |
7 |
Correct |
27 ms |
856 KB |
Output is correct |
8 |
Correct |
10 ms |
856 KB |
Output is correct |
9 |
Correct |
39 ms |
600 KB |
Output is correct |
10 |
Correct |
27 ms |
600 KB |
Output is correct |
11 |
Correct |
20 ms |
600 KB |
Output is correct |
12 |
Correct |
15 ms |
600 KB |
Output is correct |
13 |
Incorrect |
17 ms |
600 KB |
Wrong answer. |
14 |
Halted |
0 ms |
0 KB |
- |