Submission #140333

#TimeUsernameProblemLanguageResultExecution timeMemory
140333ggohThe Big Prize (IOI17_prize)C++14
0 / 100
100 ms380 KiB
#include "prize.h" #include<bits/stdc++.h> 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; } int l=0,r=n,h,ans; while(1) { h=(l+r)/2; std::vector<int> res=ask(h); if(res[0]+res[1]==0){ans=h;break;} if(res[0]==1){r=h;} else l=h; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...