This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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 time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |