Submission #1060824

#TimeUsernameProblemLanguageResultExecution timeMemory
1060824ArthuroWichThe Big Prize (IOI17_prize)C++17
0 / 100
56 ms344 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> res = ask(m);
		if (res[0] == res[1] && res[0] == 0) {
			return m;
		} else if (res[0] < res[1]) {
			l = m;
		} else if (res[0] > res[1]) {
			r = m-1;
		}
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...