# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31849 | ngkan146 | Brunhilda’s Birthday (BOI13_brunhilda) | C++98 | 606 ms | 155564 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 fi first
#define se second
using namespace std;
typedef pair<int,int> ii;
const int MAX = (int) 1e7;
int madiv[MAX+5];
int m,q;
int p[100005];
int dp[MAX+5];
void prep(){
for(int i=1;i<=m;i++)
for(int j=0;j<=MAX;j+=p[i])
madiv[j] = p[i];
}
int main(){
scanf("%d %d",&m,&q);
for(int i=1;i<=m;i++)
scanf("%d",&p[i]);
prep();
for(int i=1;i<=MAX;i++) dp[i] = 10*MAX;
deque <ii> dq;
dq.push_back(ii(0,madiv[0]-1));
for(int i=1;i<=MAX;i++){
while(dq.size() && dq.front().fi + dq.front().se < i) dq.pop_front();
if (!dq.size()) break;
assert(dq.size());
dp[i] = dp[dq.front().fi] + 1;
dq.push_back(ii(i,madiv[i]-1));
}
for(int i=1;i<=q;i++){
int n;
scanf("%d",&n);
if (dp[n] >= MAX) printf("oo\n");
else printf("%d\n",dp[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... |