제출 #1069046

#제출 시각아이디문제언어결과실행 시간메모리
1069046ortsacBrunhilda’s Birthday (BOI13_brunhilda)C++17
14.76 / 100
1094 ms40648 KiB
#include <bits/stdc++.h> using namespace std; int inf = 0x3f3f3f3f; const int MAXN = 1e7; int dp[MAXN + 10]; int32_t main() { int n, q; cin >> n >> q; vector<int> v(n); for (int i = 0; i < n; i++) cin >> v[i]; for (int i = 1; i <= MAXN; i++) { dp[i] = inf; for (auto u : v) dp[i] = min(dp[i], dp[i - (i % u)] + 1); } while (q--) { int x; cin >> x; if (dp[x] == inf) cout << "oo\n"; else cout << dp[x] << "\n"; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...