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 B = 500;
int find_best(int n) {
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] >= B) {
//~ cerr << "res0, res1; " << res[0] << ' ' << res[1] << endl;
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... |