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 foo, hoo;
void ASK(int i){
vector<int> res = ask(i);
foo = res.front();
hoo = res.back();
}
int find_best(int n) {
int l = 0, r = n - 1;
while (l <= r){
int m = (l + r) >> 1;
ASK(m);
if (foo == 1){
r = m - 1;
} else if (hoo == 1){
l = m + 1;
} else {
return m;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |