Submission #117282

#TimeUsernameProblemLanguageResultExecution timeMemory
117282WongHokFong_cppThe Big Prize (IOI17_prize)C++14
20 / 100
63 ms512 KiB
#include <iostream> #include <cstdio> #include <cstdio> #include <iomanip> #include <cstring> #include <algorithm> #include "prize.h" #include <vector> using namespace std; vector<int> a; int find_best(int n) { int l=0,r=n-1; int mid; while(0==0) { mid=(r+l)/2; a=ask(mid); if(a[0]+a[1]==0) return mid; if(a[0]==1) r=mid-1; else l=mid+1; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...