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"
#include <bits/stdc++.h>
using namespace std;
int find_best(int n)
{
int l = 0, r = n - 1;
while (l < r)
{
int c = (l + r) / 2;
auto val = ask(c);
if (!val[0] && !val[1])
return c;
if (val[0])
r = c - 1;
else
l = c + 1;
}
return l;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |