Submission #1195930

#TimeUsernameProblemLanguageResultExecution timeMemory
1195930clementineThe Big Prize (IOI17_prize)C++20
20 / 100
0 ms408 KiB
#include "prize.h"
#include<bits/stdc++.h>
using namespace std;


int find_best(int n) {
	int l = 0;
	int r = n-1;
	while(l != r)
	{
		int mid = (l + r) / 2;
		auto res = ask(mid);
		if(res[0] == 0 && res[1] == 0)
		{
			return mid;
		}
		if(res[0] == 1)
		{
			r = mid;
		}
		else
		{
			l = mid + 1;
		}
	}
	return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...