Submission #288959

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