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