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