# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
869258 | velislavgarkov | 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 "prize.h"
#include <iostream>
using namespace std;
int a[2];
int find_next(int l1, int r1) {
int l, r, mid;
l=l1; r=r1;
while (l<r) {
mid=(l+r)/2;
a=ask(mid);
if (a[0]>0) mid=r;
else l=mid+1;
}
a=ask(l-1);
if (a[0]+a[1]==0) return l-1;
return find_next(l,r1);
}
int find_best(int n) {
int ans=find_next(0,n-1);
return ans;
}