# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
155756 | Flying_dragon_02 | Brunhilda’s Birthday (BOI13_brunhilda) | C++14 | 517 ms | 118392 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;
const int N = 1e7 + 5;
int dp[N], p[N];
int m, q, last, f[N];
int main() {
scanf("%d%d", &m, &q);
for(int i = 0; i < N; i++)
p[i] = 0;
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 > last)
break;
if(i)
f[i] += f[i - 1];
dp[i] = f[i];
if(i + p[i] - 1 >= last) {
f[last + 1] += (dp[i] + 1);
f[i + p[i]] -= (dp[i] + 1);
last = max(last, i + p[i] - 1);
}
}
for(int i = 1; i <= q; i++) {
int x;
scanf("%d", &x);
if(dp[x] == 0)
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... |