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