Submission #117183

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