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 mx = 0, mx2 = 0;
for (int i = 0; i < n; ++i) {
vector<int> res = ask(i);
if (res[0] + res[1] == 0) {
return i;
}
if (res[0] + res[1] < mx2) {
++i;
continue;
}
mx2 = max(mx2, res[0] + res[1]);
if (mx2 > mx) {
swap(mx, mx2);
}
int l = i, r = n - 1;
while (l < r) {
int mid = (l + r + 1) >> 1;
vector<int> res2 = ask(mid);
if (res2[1] < res[1]) {//I skipped a more valuable person
r = mid - 1;
} else {
l = mid;
}
}
i = l;
}
assert(false);
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |