Submission #535242

#TimeUsernameProblemLanguageResultExecution timeMemory
535242MKutayBozkurtBrunhilda’s Birthday (BOI13_brunhilda)C++14
100 / 100
560 ms157508 KiB
#include <bits/stdc++.h> using namespace std; const int mx = 2e7 + 5; int bst[mx] = {}, dp[mx]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); int n, q; cin >> n >> q; int A[n]; for (int i = 0; i < n; i++) { cin >> A[i]; for (int mul = A[i] - 1; mul < mx; mul += A[i]) bst[mul] = max(bst[mul], A[i] - 1); } for (int i = mx - 2; i; i--) bst[i] = max(bst[i], bst[i + 1] - 1); fill(dp, dp + mx, 1e9); dp[0] = 0; for (int i = 1; i < mx; i++) dp[i] = dp[i - bst[i]] + 1; while (q--) { int x; cin >> x; cout << (dp[x] >= 1e9 ? "oo" : to_string(dp[x])) << '\n'; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...