# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1164677 | SmuggingSpun | The Big Prize (IOI17_prize) | C++20 | 0 ms | 0 KiB |
#include<bits/stdc++.h
#include "prize.h"
using namespace std;
int find_best(int n) {
int low = 0, high = n - 1;
while(low <= high){
int mid = (low + high) >> 1;
vector<int>ret = ask(mid);
if(ret[0] == 0 && ret[1] == 0){
return mid;
}
if(ret[0] == 1){
high = mid - 1;
}
else{
low = mid + 1;
}
}
}