# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
108010 | 2019-04-26T18:50:09 Z | reda | The Big Prize (IOI17_prize) | C++14 | 0 ms | 0 KB |
#include<bits/stdc++.h> #include "prize.h" using namespace std; int find_best(int n) { int low , high; low =0; high=n-1; while(low<=high) { int mid=(low+high)/2; vector<int> arr=ask(mid); if(arr[0]==0 && arr[1]==0)return mid; else{ if(arr[0])high=mid; else low=mid+1; } return -1; }