oj.uz

Submission #1078190

# Submission time Handle Problem Language Result Execution time Memory
1078190 2024-08-27T13:45:59 Z Faisal_Saqib Rarest Insects (IOI22_insects) C++17
0 / 100
 276 ms 344 KB 
#include <bits/stdc++.h>
using namespace std;
void move_inside(int i);
void move_outside(int i);
int press_button();
int min_cardinality(int n)
{
	set<int> machine;
	int sm=0;
	machine.insert(0);
	for(int i=1;i<n;i++)
	{
		move_inside(i);
		if(press_button()==1)
		{
			sm++;
			machine.insert(i);
		}
		else
			move_outside(i);
	}
	// for(auto i:machine)
	// 	move_outside(i),sm--;
	// machine.clear();
	int sz=sm,np=n;
	while(1)
	{
		int mid=(np)/sz;
		for(auto i:machine)
			move_outside(i),sm--;
		machine.clear();
		for(int i=0;i<n and sm<(sz*mid);i++)
		{
			if(machine.find(i)==machine.end())
			{
				move_inside(i);
				if(press_button()>mid)
				{
					move_outside(i);
				}
				else
				{
					sm++;
					machine.insert(i);
				}
			}
		}
		if(sm==((sz*mid)))
		{
			return mid; // this is the answer
		}
		else{
			np=sm;
		}
	}
	return -1;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 344 KB Wrong answer.
2 Halted 0 ms 0 KB -

Subtask #3
0 / 75.0

# Verdict Execution time Memory Grader output
1 Incorrect 276 ms 344 KB Too many queries.
2 Halted 0 ms 0 KB -