# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
334273 | Fischer | Brunhilda’s Birthday (BOI13_brunhilda) | C++14 | 1109 ms | 262148 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>
#define rep(x, y, z) for (int x = y; x < z; ++x)
#define reo(x, y) for (int x = 0; x < y; ++x)
using namespace std;
const int maxn = 1e7 + 10;
int head[maxn];
int val[10 * maxn];
int nxt[10 * maxn];
int T = 0;
int cnt[maxn];
int dp[maxn];
int p[100010];
int main() {
int m, q;
scanf("%d%d", &m, &q);
memset(head, -1, sizeof head);
for (int i = 0; i < m; ++i) {
scanf("%d", p+i);
for (int j=p[i]; j<maxn; j+=p[i]) {
assert(T < 10 * maxn);
nxt[T] = head[j];
head[j] = T;
val[T] = j - p[i];
T++;
}
}
int front = 0;
cnt[0] = m;
const int mx = 1e9;
for (int i = 1; i < maxn; ++i) {
for (int x = head[i]; ~x; x = nxt[x]) {
cnt[i]++;
cnt[val[x]]--;
}
while (front < i && cnt[front] == 0) front++;
if (front == i) dp[i] = mx;
else dp[i] = min(mx, dp[front] + 1);
}
while (q--) {
int n;
scanf("%d", &n);
if (dp[n] > n) puts("oo");
else printf("%d\n", dp[n]);
}
return 0;
}
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... |