# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155737 | Flying_dragon_02 | Brunhilda’s Birthday (BOI13_brunhilda) | C++14 | 959 ms | 118904 KiB |
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 fi first
#define se second
#define pb push_back
#define mp make_pair
typedef pair<int, int> ii;
const int mod = 1e9 + 7;
const int inf = 1e9;
int add(int x, int y) {
return (1ll * x + 1ll * y) % mod;
}
int del(int x, int y) {
return ((1ll * x - 1ll * y) % mod + mod) % mod;
}
int mul(int x, int y) {
return (1ll * x * 1ll * y) % mod;
}
const int N = 1e7 + 5;
int dp[2 * N], p[2 * N], used[N];
deque<int> dq;
int m, q;
int main() {
scanf("%d%d", &m, &q);
for(int i = 0; i < N; i++)
p[i] = 0;
for(int i = 1; i <= N - 5; i++)
dp[i] = inf;
for(int i = 1; i <= m; i++) {
int x;
scanf("%d", &x);
for(int l = 0; l < N; l++) {
if(x * l >= N) break;
p[x * l] = max(p[x * l], x);
}
}
for(int i = 0; i <= N - 5; i++) {
//if(i <= 6)
//cout << used[i] << " " << dq.size() << " " << i << "\n";
for(int j = 1; j <= used[i]; j++)
dq.pop_back();
if(dq.size() > 0)
dp[i] = dq.back();
if(p[i] != 0)
dq.push_front(dp[i] + 1);
if(i + p[i] > N - 5) continue;
used[i + p[i]] ++;
}
for(int i = 1; i <= q; i++) {
int x;
cin >> x;
if(dp[x] == inf)
cout << "oo\n";
else
cout << dp[x] << "\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |