# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
117264 | WongHokFong_cpp | 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 <iostream>
#include "prize.h"
#include <vector>
vector <int> res;
int find_best(int n)
{
int l=0,r=n-1;
do
{
int mid=(l+r)/2;
res=ask(mid);
if (res[1]>0) r=mid;
else if (res[2]>0) l=mid;
else return mid;
}
while (l<r);
}