Submission #597828

#TimeUsernameProblemLanguageResultExecution timeMemory
597828yanndev커다란 상품 (IOI17_prize)C++17
20 / 100
1 ms296 KiB
#include "prize.h" #include <bits/stdc++.h> using namespace std; int find_best(int n) { int l = 0; int r = n - 1; while (l < r) { int m = (l + r) / 2; vector<int> ans = ask(m); if (ans[0] == 0 && ans[1] == 0) return m; if (ans[0] > 0) r = m - 1; else l = m + 1; } return l; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...