| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1356258 | vjudge1 | 드문 곤충 (IOI22_insects) | C++20 | 11 ms | 456 KiB |
#include "insects.h"
#include<bits/stdc++.h>
using namespace std;
int a[2100];
vector<int> lef;
vector<int> lastin;
vector<int> lastout;
int min_cardinality(int N) {
int k=0;
int val=0;
int ins=0;
for(int i=0;i<N;i++){
move_inside(i);
val=press_button();
a[i]=1;
ins++;
if(val==1){
k++;
}
else{
lef.push_back(i);
ins--;
a[i]=0;
move_outside(i);
}
}
int l=1,r=N/k;
while(l<r){
int mid=(l+r+1)/2;
for(auto i:lef){
if(ins==mid*k){
lastout.push_back(i);
continue;
}
a[i]=1;
move_inside(i);
ins++;
val=press_button();
if(val>mid){
lastout.push_back(i);
move_outside(i);
ins--;
a[i]=0;
}
else{
lastin.push_back(i);
}
}
if(ins==mid*k){
l=mid;
lef=lastout;
}
else {
r=mid-1;
for(auto i : lastin){
move_outside(i);
a[i]=0;
ins--;
}
reverse(lastin.begin(), lastin.end());
lef=lastin;
}
lastin.clear();
lastout.clear();
}
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... | ||||
