# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1053935 | aaaaaarroz | 커다란 상품 (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 "prize.h"
#include<bits/stdc++.h>
using namespace std;
vector<int>ask(int i);
int worse=INT_MAX;
int subir(){
int l=0,r=n-1;
while(l<r){
int mid=(l+r+1)/2;
vector<int>res=ask(mid);
if((res[0]+res[1])<worse){
return mid;
}
if(res[0]==0){
l=mid;
}
else{
r=mid-1;
}
}
}
int find_best(int n) {
int retorno=INT_MAX;
while(worse!=0){
retorno=subir();
}
return retorno;
}