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