# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
507583 | Hanksburger | The Big Prize (IOI17_prize) | C++17 | 0 ms | 0 KiB |
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 <bits/stdc++.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> res=ask(mid);
if (res[0])
R=mid-1;
else if (res[1])
L=mid+1;
else
return mid;
}
return L;
}