Submission #131449

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