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;
const int N = 200200;
vector<int> arr[N];
vector<int> ASK(int p) {
if (arr[p].empty())
arr[p] = ask(p);
return arr[p];
}
int sum(int i) {
return ASK(i)[0] + ASK(i)[1];
}
int find_best(int n) {
int val = sum(0);
for (int i = 0; i < min(n, 480); i++) {
if (!sum(i)) return i;
val = max(val, sum(i));
}
int i = 480;
while (i < n) {
int x = sum(i);
if (!x)
return i;
if (x < val)
i++;
else {
int l = i, r = n;
while (r - l > 1) {
int m = (l + r) / 2;
if (ASK(m) == ASK(l))
l = m;
else {
if (!sum(m))
return m;
r = m;
}
}
i = r;
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |