제출 #1060067

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1060067		parsadox2	Rarest Insects (IOI22_insects)	C++17	25 / 100	248 ms	844 KiB

insects

#include <bits/stdc++.h>
#include "insects.h"

using namespace std;

const int N = 2e3 + 10;
int n;
bool bad[N];

bool check(int mid)
{
	for(int i = 0 ; i < n ; i++)
	{
		bad[i] = false;
		move_inside(i);
		int val = press_button();
		if(val > mid)
		{
			bad[i] = true;
			move_outside(i);
		}
	}
	for(int i = 0 ; i < n ; i++)  if(!bad[i])
		move_outside(i);
	for(int i = 0 ; i < n ; i++)  if(bad[i])
	{
		move_inside(i);
		int val = press_button();
		if(val > 1)
			move_outside(i);
	}
	bool flg = false;
	for(int i = 0 ; i < n ; i++)  if(!bad[i])
	{
		move_inside(i);
		int val = press_button();
		if(val == 1)
		{
			flg = true;
		}
		move_outside(i);
	}
	for(int i = 0 ; i < n ; i++)  if(bad[i])
		move_outside(i);
	return flg;
}

int min_cardinality(int nn)
{
	n = nn;
	int low = 0 , high = n;
	while(high - low > 1)
	{
		int mid = (low + high) >> 1;
		if(check(mid))
			high = mid;
		else
			low = mid;
	}
	return high;
}

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