제출 #1060715

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1060715		AdamGS	드문 곤충 (IOI22_insects)	C++17	50 / 100	138 ms	1220 KiB

insects

#include "insects.h"
#include<bits/stdc++.h>
using namespace std;
#define rep(a, b) for(int a = 0; a < (b); ++a)
#define st first
#define nd second
#define pb push_back
#define all(a) a.begin(), a.end()
vector<int>V;
int n;
int solve(int l, int r, vector<int>czy) {
	/*cout << l << " " << r << " ";
	for(auto i : czy) cout << i;
	cout << '\n';*/
	if(l==r) return l;
	int mid=(l+r+1)/2;
	vector<int>P;
	rep(i, n) if(czy[i]) {
		move_inside(i);
		if(press_button()==mid+1) move_outside(i);
		else P.pb(i);
	}
	bool ok=true;
	for(auto i : V) {
		move_inside(i);
		if(press_button()<=mid) ok=false;
		move_outside(i);
	}
	if(ok) {
		for(auto i : P) czy[i]=0;
		return solve(mid, r, czy);
	}
	rep(i, n) czy[i]=0;
	for(auto i : P) czy[i]=1;
	for(auto i : P) move_outside(i);
	return solve(l, mid-1, czy);
}
int min_cardinality(int _n) {
	n=_n;
	rep(i, n) {
		move_inside(i);
		if(press_button()==1) V.pb(i);
		else move_outside(i);
	}
	for(auto i : V) move_outside(i);
	vector<int>czy(n, 1);
	for(auto i : V) czy[i]=0;
	return solve(0, n, czy)+1;
	//return solve(0, (n-V.size())/V.size(), czy)+1;
}

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