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