Submission #1253302

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