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 "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
int find_best(int n) {
// std::vector<int> res = ask(i);
int l=-1, r=n;
while(l+1 < r){
int mid = (l+r)/2;
vector<int> tmp = ask(mid);
if(tmp[0] == 0)l = mid;
else r = mid;
}return l;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |