Submission #426687

#TimeUsernameProblemLanguageResultExecution timeMemory
426687HazemThe Big Prize (IOI17_prize)C++14
20 / 100
58 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+1)/2;
		vector<int>vec = ask(mid);
		if(!vec[0]&&!vec[1])
			return mid;
		if(!vec[0])l = mid+1;
		if(!vec[1])r = mid-1;
	}
	return l;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...