Submission #889924

#TimeUsernameProblemLanguageResultExecution timeMemory
889924elotelo966The Big Prize (IOI17_prize)C++17
20 / 100
1 ms600 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; int find_best(int n) { int l=0,r=n; while(l<=r) { int m=(l+r)/2; std::vector<int> res = ask(m); if(res[0] + res[1] == 0) return m; if(res[0]<res[1]) l=m+1; else r=m-1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...