Submission #604205

#TimeUsernameProblemLanguageResultExecution timeMemory
604205pirhosigThe Big Prize (IOI17_prize)C++17
20 / 100
1 ms336 KiB
#include "prize.h" int find_best(int n) { int low = 0; int upp = n - 1; while (low < upp) { int mid = (low + upp) / 2; auto a = ask(mid); if (a[0] + a[1] == 0) return mid; if (a[0]) upp = mid - 1; else low = mid + 1; } return low; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...