Submission #1078060

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