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 low = 0;
int upp = n - 1;
while (low < upp) {
int mid = (low + upp) / 2;
auto a = ask(mid);
if (a[0] + a[1] == 0) return mid;
if (a[0]) upp = mid - 1;
else low = mid + 1;
}
return low;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |