This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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;
		vector<int> res = ask(mid);
		if (res[0] == 1) {
			assert(res[1] == 0);
			r = mid - 1; 
		} else if (res[1] == 1) {
			l = mid + 1; 
		} else {
			return mid;
		}
	}
	assert(false);
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |