Submission #711759

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