# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1053935 | 2024-08-11T21:41:39 Z | aaaaaarroz | The Big Prize (IOI17_prize) | C++17 | 0 ms | 0 KB |
#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; }