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 "grader.cpp"
#include <bits/stdc++.h>
using namespace std;
// vector <int> res = ask(i);
int find_best(int n) {
vector <int> res = ask(0);
if (res[0] + res[1] == 0) {
return 0;
}
res = ask(n - 1);
if (res[0] + res[1] == 0) {
return n - 1;
}
int l = 0, r = n - 1;
while (r - l > 1) {
int mid = (l + r) >> 1;
res = ask(mid);
if (res[1] == 1) {
l = mid;
} else {
r = mid;
}
}
return r;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |