Submission #426739

#TimeUsernameProblemLanguageResultExecution timeMemory
426739A_DThe Big Prize (IOI17_prize)C++14
0 / 100
3 ms428 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; int find_best(int n) { int l=0,r=n-1; while(l<=r){ int mid=(l+r)/2; vector<int> vec=ask(mid); if(vec[0]==vec[1])return mid; if(vec[0]){ l=mid+1; } else r=mid-1; } assert(0); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...