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