Submission #713947

#TimeUsernameProblemLanguageResultExecution timeMemory
713947stevancvBrunhilda’s Birthday (BOI13_brunhilda)C++14
100 / 100
458 ms157440 KiB
#include <bits/stdc++.h> #define ll long long #define ld long double #define sp ' ' #define en '\n' #define smin(a, b) a = min(a, b) #define smax(a, b) a = max(a, b) using namespace std; const int N = 1e5 + 2; const int M = 2e7 + 2; const int inf = 1e9; int dp[M], gde[M]; int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); int n, q; cin >> n >> q; for (int i = 1; i <= n; i++) { int x; cin >> x; for (int j = x - 1; j < M; j += x) gde[j] = x - 1; } for (int i = M - 2; i >= 1; i--) { smax(gde[i], gde[i + 1] - 1); } for (int i = 1; i < M; i++) { if (gde[i] > 0) dp[i] = dp[i - gde[i]] + 1; else dp[i] = inf; } for (int i = 1; i <= q; i++) { int x; cin >> x; if (dp[x] >= inf) cout << "oo" << en; else cout << dp[x] << en; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...