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