Submission #1299552

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