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