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