# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
163972 | luciocf | Brunhilda’s Birthday (BOI13_brunhilda) | C++14 | 476 ms | 41476 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;
const int maxn = 1e5+10;
const int maxv = 1e7+10;
const int inf = 1e9+10;
int a[maxn];
int dp[maxv];
int main(void)
{
int n, q;
scanf("%d %d", &n, &q);
for (int i = 1; i <= n; i++)
scanf("%d", &a[i]);
int P = a[n];
long long prod = 1ll;
for (int i = 1; i <= n; i++)
if (prod < maxv)
prod = 1ll*prod*a[i];
for (int i = 1; i < maxv; i++)
dp[i] = inf;
dp[1] = 1;
for (int i = 2; i < maxv; i++)
{
if (i%prod == 0) continue;
if ((i-1)%prod == 0)
{
for (int j = n; j >= 1; j--)
if (i%a[j])
dp[i] = min(dp[i], dp[i-(i%a[j])]);
}
else if (i%P == 0 || (i-1)%P == 0) dp[i] = dp[i-1]+1;
else dp[i] = dp[i-1];
}
for (int i = 1; i <= q; i++)
{
int x;
scanf("%d", &x);
if (dp[x] == inf) printf("oo\n");
else printf("%d\n", dp[x]);
}
}
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... |