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"
using namespace std;
int sub1(int st, int ed) {
if(st == ed) return st;
int mid = (st + ed) / 2;
vector<int> v = ask(mid);
int l = v[0], r = v[1];
if(l == 1) return sub1(st, mid-1);
else if(r == 1) return sub1(mid+1, ed);
else return mid;
}
int find_best(int n) {
return sub1(0, n-1);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |