제출 #658602

#제출 시각아이디문제언어결과실행 시간메모리
658602pere_gilRarest Insects (IOI22_insects)C++17
0 / 100
1 ms208 KiB
#include "insects.h"
#include "bits/stdc++.h"
using namespace std;
     
int get(int n){
	int res=0;
	bool in[n]={};
	for(int i=0;i<n;i++){
		move_inside(i);
		if(press_button()>1) move_outside(i);
		else{
			res++;
			in[i]=true;
		}
	}
	for(int i=0;i<n;i++) if(in[i]) move_outside(i);
	return res;
}
     
bool check(int n, int dif, int tot_in, bool in[], int x){
	vector<int> aux;
	for(int i=0;i<n;i++){
		if(in[i]) continue;
		move_inside(i);
		if(press_button()>x) move_outside(i);
		else{
			in[i]=true;
			tot_in++;
			aux.push_back(i);
		}
		if(tot_in==x*dif) return true;
	}

	for(auto i: aux) move_outside(i);
	return false;
}
     
int min_cardinality(int n) {
	int dif=get(n);
     
	if(dif==1) return n;
     
	//printf("%d\n",dif);

	bool in[n]={};
	int tot_in=0;
	
	int l=1,r=n;
	while(l+1<r){
		int med=(l+r)/2;
		if(check(n,dif,tot_in,in,med)) l=med;
		else r=med;
	}
	return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...