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