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 <bits/stdc++.h>
#include "prize.h"
using namespace std;
using ll = long long;
int find_best(int n) {
int i = 0;
int logn = __lg(n) + 2;
for (; i < n;) {
auto a = ask(i);
if (a[0] == 0 && a[1] == 0) {
return i;
} else {
for (int j = logn - 1; j > -1; --j) {
if (i + (1 << j) < n && ask(i + (1 << j)) == a) {
i += 1 << j;
}
}
++i;
}
}
assert(false);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |