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>
int find_best(int n) {
for(int i = 0; i < n; i++) {
std::vector<int> res = ask(i);
if(res[0] + res[1] == 0)
return i;
}
int l=0,r=n,h,ans;
while(1)
{
h=(l+r)/2;
std::vector<int> res=ask(h);
if(res[0]+res[1]==0){ans=h;break;}
if(res[0]==1){r=h;}
else l=h;
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |