Submission #507584

#TimeUsernameProblemLanguageResultExecution timeMemory
507584HanksburgerThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms288 KiB
#include "prize.h"
#include <bits/stdc++.h>
using namespace std;
int find_best(int N)
{
	int L=0, R=N-1;
	while (L<R)
	{
		int mid=(L+R)/2;
		vector<int> res=ask(mid);
		if (res[0])
			R=mid-1;
		else if (res[1])
			L=mid+1;
		else
			return mid;
	}
	return L;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...