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