Submission #310507

#TimeUsernameProblemLanguageResultExecution timeMemory
310507keta_tsimakuridzeThe Big Prize (IOI17_prize)C++14
20 / 100
1 ms384 KiB
#include "prize.h" int find_best(int n) { int l=0,r=n-1; while(l<=r){ int mid=(l+r)/2; std::vector<int> res = ask(mid); if(res[0] + res[1] == 0) return mid; else if(res[0]) r=mid-1; else l=mid+1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...