Submission #131456

#TimeUsernameProblemLanguageResultExecution timeMemory
13145620160161simoneThe Big Prize (IOI17_prize)C++14
20 / 100
93 ms376 KiB
#include <bits/stdc++.h>
#include "prize.h"
using namespace std;
int find_best(int n) 
{
	int l=0,r=n-1;
	while(0==0)
	{
		int mid=(l+r)/2;
		vector<int> q=ask(mid);
		if(q[0]==0&&q[1]==0)
		{
			return mid;
		}
		else
		{
			if(q[0]==1)
			{
				r=mid-1;
			}
			else l=mid+1;
		}
	} 
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...