Submission #283695

#TimeUsernameProblemLanguageResultExecution timeMemory
283695emanIaicepsaThe Big Prize (IOI17_prize)C++14
20 / 100
1 ms416 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 m = (l+r)/2;
		vector<int> v = ask(m);
		if(v[0] + v[1] == 0) return m;
		else if(v[0]) r = m - 1;
		else l = m + 1;
	}
	return -1;
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...