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 <bits/stdc++.h>
#include "prize.h"
using namespace std;
int find_best(int n) {
int l = 0;
int r = n-1;
int ans = -1;
vector<int> hola(2);
while (l <= r){
int m = (l+r)/2;
hola = ask(m);
if (hola[0] == 0 && hola[1] == 0){
ans = m;
break;
}
else if (hola[0] > hola[1]){
r = m-1;
}
else{
l = m+1;
}
}
return ans;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |