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