| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1356200 | vjudge1 | 드문 곤충 (IOI22_insects) | C++20 | 71 ms | 424 KiB |
#include "insects.h"
#include<bits/stdc++.h>
using namespace std;
int a[2100];
int min_cardinality(int N) {
int k=0;
int val=0;
for(int i=0;i<N;i++){
move_inside(i);
val=press_button();
a[i]=1;
if(val==1){
k++;
}
else{
a[i]=0;
move_outside(i);
}
}
for(int i=0;i<N;i++){
if(a[i]){
move_outside(i);
a[i]=0;
}
}
int now=1;
int ins=0;
while(now<=N/k){
for(int i=0;i<N;i++){
if(!a[i]){
a[i]=1;
move_inside(i);
ins++;
}
val=press_button();
if(val>now){
move_outside(i);
ins--;
a[i]=0;
}
}
if(ins==now*k){
now*=2;
}
else break;
}
int l=now/2,r=now;
while(l<r){
int ins=0;
int mid=(l+r+1)/2;
for(int i=0;i<N;i++){
move_inside(i);
val=press_button();
ins++;
a[i]=1;
if(val>mid){
move_outside(i);
ins--;
a[i]=0;
}
}
if(ins==mid*k)l=mid;
else r=mid-1;
for(int i=0;i<N;i++){
if(a[i]){
move_outside(i);
a[i]=0;
}
}
}
return l;
}| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
