# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
599121 | pakhomovee | The Big Prize (IOI17_prize) | C++17 | 0 ms | 0 KiB |
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"
int find_best(int n) {
int pr = 0;
for (int i = 0; i < 400; ++i) {
int l = pr, r = n;
while (l + 1 < r) {
int m = (l + r) / 2;
if (ask(m)[0]) {
r = m;
} else {
l = m;
}
}
vector<int> arr = ask(l);
if (arr[0] == arr[1] && arr[0] == 0) {
return l;
}
pr = l + 1;
}
return -1;
}