# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
165237 | Segtree | 커다란 상품 (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"
using namespace std;
typedef long long ll;
int find_best(int n){
int l=0,r=n-1,mid;
while(l<r){
mid=(l+r)>>1;
int a[]=ask(mid);
if(a[0]==0&&a[1]==0){
return mid;
}
if(a[0]==1){
r=mid-1;
}
if(a[1]==0){
l=mid+1;
}
}
}