# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
89996 | 2018-12-19T15:30:14 Z | nikolapesic2802 | The Big Prize (IOI17_prize) | C++14 | 0 ms | 0 KB |
#include <bits/stdc++.h> using namespace std; int find_best(int n) { int l=0,r=n-1; while(true) { int m=(l+r)>>1; vector<int> tr=ask(m); if(tr[0]==1) { r=m-1; } else { if(tr[1]==1) { l=m+1; } else { return m; } } } /*for(int i = 0; i < n; i++) { std::vector<int> res = ask(i); if(res[0] + res[1] == 0) return i; } return 0;*/ }