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>
using namespace std;
#define int long long
#define pii pair<long long, long long>
#define fr first
#define se second
int inf = 0x3f3f3f3f3f3f3f3f;
const int MAXN = 1e7;
int dp[MAXN + 10];
set<pii> s;
int32_t main() {
int n, q;
cin >> n >> q;
for (int i = 0; i < n; i++) {
int a;
cin >> a;
s.insert({a, a});
}
for (int i = 1; i <= MAXN; i++) {
dp[i] = inf;
while ((((*s.begin()).fr + (*s.begin()).se) <= i)) {
auto u = *s.begin();
s.erase(s.begin());
s.insert({u.fr + u.se, u.se});
}
dp[i] = min(dp[i], dp[(*s.begin()).fr] + 1);
}
while (q--) {
int x;
cin >> x;
if (dp[x] == inf) cout << "oo\n";
else cout << dp[x] << "\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |