# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
316069 | MrDomino | The Big Prize (IOI17_prize) | C++14 | 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 <bits/stdc++.h>
#include "prize.h"
using namespace std;
int find_best(int n) {
/// subtask 1
int l = 0, r = n - 1;
while (l <= r) {
int m = (l + r) / 2;
vector<int> v = ask(m);
if (v[0] == 0 && v[1] == 0) {
return i;
}
if (v[0] == 1) {
r = m - 1;
} else {
l = m + 1;
}
}
assert(0);
}