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