# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
282875 | Erkhemkhuu | 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 <bits/stdc++.h>
using namespace std;
#define ll int
#define pb push_back
#define mp make_pair
#define F first
#define S second
const ll N = 105;
ll find_best(ll n) {
ll l, r, mid;
l = 0; r = n;
while(l + 1 < r) {
mid = (l + r) / 2;
vector <ll> asked = ask(mid);
if(!asked[0] && !asked[1]) return mid;
if(!asked[0] && asked[1]) l = mid;
else r = mid;
}
return mid;
}