| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 872291 | Lib | Rarest Insects (IOI22_insects) | C++17 | 0 ms | 0 KiB |
이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
#include "insects.h"
//#include "stub.cpp"
using namespace std;
int l,r,mid;
vector <int> PrevIndexIn,PrevIndexOut,RemainingInsects;
int InMachine[2003];
int n;
int TypeCount=0;
int CurrentInMachine=0;
int PossibleMincount(int cnt){
PrevIndexIn.clear();
PrevIndexOut.clear();
//Pushing insects inside the machine, keeping track of the ones being putted inside for this iteration of binary searching
for(int i=0;i<RemainingInsects.size();i++){
move_inside(RemainingInsects[i]);
InMachine[RemainingInsects[i]]=1;
PrevIndexIn.push_back(RemainingInsects[i]);
CurrentInMachine++;
if(press_button()>cnt){
PrevIndexIn.pop_back();
PrevIndexOut.push_back(RemainingInsects[i]);
InMachine[RemainingInsects[i]]=0;
move_outside(RemainingInsects[i]);
CurrentInMachine--;
}
}
RemainingInsects.clear();
if(CurrentInMachine<cnt*TypeCount){
//There clearly exist a type of insect with cardinality less than cnt, so the answer is less than cnt. Removing insects from last iteration.
while(!PrevIndexIn.empty()){
InMachine[PrevIndexIn.back()]=0;
move_outside(PrevIndexIn.back());
PrevIndexOut.push_back(PrevIndexIn.back());
PrevIndexIn.pop_back();
CurrentInMachine--;
}
RemainingInsects=PrevIndexOut;
return 0;
}else if(CurrentInMachine==cnt*TypeCount){
//As every type of insects has at least cnt insects, the answer is at least cnt. Just return true
RemainingInsects=PrevIndexOut;
PrevIndexIn.clear();
return 1;
}
}
int min_cardinality(int N){
//Remember to initialize as this is multitest
for(int i=0;i<N;i++){
InMachine[i]=0;
}
PrevIndexIn.clear();
PrevIndexOut.clear();
RemainingInsects.clear();
n=N;
l=1;
//Phase 1: Determining the amount of different types of insects
TypeCount=0;
CurrentInMachine=0;
for(int i=0;i<n;i++){
move_inside(i);
InMachine[i]=1;
CurrentInMachine++;
if(press_button()>1){
move_outside(i);
InMachine[i]=0;
CurrentInMachine--;
}else{
TypeCount++;
}
}
for(int i=0;i<n;i++){
if(!InMachine[i]){
RemainingInsects.push_back(i);
}
}
r=(RemainingInsects.size()/TypeCount+1);
//Phase 2: Binary search for the answer
while(r-l>=1){
mid=(l+r+1)/2;
if(PossibleMincount(mid)){
l=mid;
r=min(r,(RemainingInsects.size()/TypeCount+mid));
}else{
r=mid-1;
}
}
return l;
}