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;
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define mk make_pair
int find_best(int n) {
int l=0;
int r=n-1;
while(l<r){
int mid=(l+r+1)/2;
vector<int> res = ask(mid);
if(res[0]==0 && res[1]==0) return mid;
if(res[0]==1){
r=mid-1;
}
else l=mid+1;
}
return l;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |