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 bs(int n) {
int l = 0, r = n-1, mid, ans=-1;
while(r >= l) {
mid = l + (r-l)/2;
vector<int> a = ask(mid);
if(a[0] == 0 && a[1] == 0) { ans = mid; break; }
if(a[0] == 1) r = mid-1;
else l = mid+1;
}
return ans;
}
int find_best(int n) {
return bs(n);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |