Submission #434289

#TimeUsernameProblemLanguageResultExecution timeMemory
434289MonchitoThe Big Prize (IOI17_prize)C++14
20 / 100
1 ms328 KiB
#include "prize.h" using namespace std; int bs(int n) { int l = 0, r = n-1, mid, ans=-1; while(r >= l) { mid = l + (r-l)/2; vector<int> a = ask(mid); if(a[0] == 0 && a[1] == 0) { ans = mid; break; } if(a[0] == 1) r = mid-1; else l = mid+1; } return ans; } int find_best(int n) { return bs(n); }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...