Submission #1335719

#TimeUsernameProblemLanguageResultExecution timeMemory
1335719sporknivesRarest Insects (IOI22_insects)C++20
47.50 / 100
61 ms512 KiB
#include <bits/stdc++.h>
#include "insects.h"
using namespace std;

int min_cardinality(int N) {
	int d = 0;
	bool marked[N]; memset(marked,false,sizeof(marked));
	set<int> s;
	vector<int> to_remove;
	for(int i=0;i<N;i++) {
		if(s.find(i)==s.end())move_inside(i);
		s.insert(i);
		int res = press_button();
		if(res>1) {
			if(s.find(i)!=s.end())move_outside(i);
			s.erase(i);
		}
		else {
			d++;
			marked[i]=true;
		}
	}
	
	int ans = 0;
	int lo=1,hi=N/d;
	while(lo<=hi) {
		int mid = (lo+hi)/2;
		
		to_remove.clear();
		int cnt=0;
		for(int i=0;i<N;i++) {
			bool added=false;
			if(s.find(i)==s.end()){
				 move_inside(i);
				 added=true;
			 }
			s.insert(i);
			int res = press_button();
			if(res > mid) {
				if(s.find(i)!=s.end())move_outside(i);
				s.erase(i);
			}
			else {
				cnt++;
				if(added) to_remove.push_back(i);
			}
		}
		if(cnt==d*mid) {
			lo=mid+1;
			ans=max(ans,mid);
		}
		else {
			hi=mid-1;
			for(int x: to_remove) {
				if(s.find(x)!=s.end())move_outside(x);
				s.erase(x);
			}
		}
	}
	
	return ans;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...