# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
41845 | 2018-02-21T15:09:01 Z | rahasia | The Big Prize (IOI17_prize) | C++14 | 0 ms | 0 KB |
//#include "prize.h" #include<bits/stdc++.h> using namespace std; int l,r,c,ma; int find_best(int n) { for(int i = 0; i < n; i++) { std::vector<int> res = ask(i); if(res[0] + res[1] == 0) return i; // ma=max(ma,res[0]+res[1]); // if(res[0]+res[1]<ma) // continue; l=i+1; r=n-1; while(l<=r) { c=(l+r)/2; vector<int> hv=ask(c); if(hv==res) { i=c; l=c+1; } else r=c-1; } } return 0; }