제출 #838329

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
838329		Baytoro	드문 곤충 (IOI22_insects)	C++17	0 / 100	1 ms	208 KiB

insects

#include <bits/stdc++.h>
using namespace std;
#include "insects.h"
//#include "stub.cpp"
#define ll long long
#define sc second
#define fr first
#define pb push_back
int min_cardinality(int n) {
	vector<int> used(n);
	int cnt=0;
	auto in = [&](int x){
		if(!used[x]){
			cnt++;
			used[x]=1;
			move_inside(x);
		}
	};
	auto out = [&](int x){
		if(used[x]){
			cnt--;
			used[x]=0;
			move_outside(x);
		}
	};
	for(int i=0;i<n;i++){
		in(i);
		if(press_button()>1){
			out(i);
		}
	}
	int ans=0;
	if(cnt==1) return n;
	int s=cnt;
	int l=1,r=n/s+1;
	const int A=60,B=40;
	vector<int> a(n);
	while(r-l>1){
		int md=(A*l+B*r)/(A+B);
		if(md==r) md--;
		else if(md==l) md++;
		for(int i=0;i<n;i++){
			if(!a[i] && used[i]) out(i);
		}
		for(int i=0;i<n && cnt<md*s;i++){
			if(!a[i]){
				in(i);
				if(press_button()>md) out(i);
			}
		}
		for(int i=0;i<n;i++){
			if(!a[i]){
				if(cnt==md*s && used[i]) a[i]++;
				else if(cnt!=md*s && !used[i]) a[i]++;
			}
		}
		if(cnt==md*s) l=md;
		else r=md;
	}
	return ans;
}

• Subtask 1: 0 / 10
• Subtask 2: 0 / 15
• Subtask 3: 0 / 75