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