Submission #559770

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