# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1188980 | Mamikonm1 | The Big Prize (IOI17_prize) | C++20 | 0 ms | 0 KiB |
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int find_best(int n) {
int l = 1, r = n + 1, md, ans = -1;
while (l + 1 < r) {
md = r + l >> 1;
vector<int>cur = ask(md);
if (cur[0])
r = md;
else if (cur[0])
l = md;
else {
ans = md;
break;
}
}
return ans;
}