#include<bits/stdc++.h>
#include "insects.h"
#define f first
#define s second
#define pb push_back
using namespace std;
int siz[2001]{0};
int min_cardinality(int N) {
vector<int>vec;
int vis[2001]={0};
move_inside(0);
int sz=0;
for(int i=0;i<N;i++)siz[i]=1;
for(int i=0;i<N;i++){
if(vis[i])continue;
move_inside(i);
if(press_button()==1){
vis[i]=1;sz++;vec.pb(i);
}
else move_outside(i);
}
int l=1,r=N;
int memsize=sz;
while(l<r){
int m=(l+r+1)>>1;
int cnt=0;
for(int i=0;i<N;i++){
if(!vis[i]){
move_inside(i);
if(press_button()<=m){
cnt++;vis[i]=2;
}
else move_outside(i);
}
}
for(int i=0;i<N;i++)if(vis[i]==2)move_outside(i);
if(cnt/memsize<m-1)r=m-1;
else l=m;
}return l;
}
# |
결과 |
실행 시간 |
메모리 |
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 |
Incorrect |
0 ms |
344 KB |
Wrong answer. |
5 |
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 |
Incorrect |
0 ms |
344 KB |
Wrong answer. |
5 |
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 |
1 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 |
Incorrect |
0 ms |
344 KB |
Wrong answer. |
7 |
Halted |
0 ms |
0 KB |
- |