# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
134069 | wzy | Brunhilda’s Birthday (BOI13_brunhilda) | C++11 | 288 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>
using namespace std;
const int N = 100002;
#define pii pair<int,int>
const int MX = 10000005;
int primes[N] ;
int m , q;
int dp[MX];
vector<int> dq[MX];
// valores formam sequencia (0 , 1 , 2, 3 ,...)
// pega o menor multiplo menor que i
int32_t main(){
scanf("%d%d" , &m , &q);
for(int i = 0 ; i < MX ;i ++){
dp[i] = 1000000000;
}
for(int i = 0 ; i < m ; i ++){
scanf("%d" , &primes[i]);
dq[0].push_back(primes[i]);
}
dp[0] = 0;
int curr = 0;
for(int i = 0 ; i < MX ; i ++){
for(auto w : dq[i]){
int u = i + w;
curr = max(curr, i+1);
curr = min(curr , MX - 1);
for(int j = curr; j < min(u , MX) ; j++){
dp[j] = dp[i] + 1;
}
curr = max(curr, u);
curr = min(curr , MX - 1);
if(u < MX) dq[u].push_back(w);
}
dq[i].clear();
}
for(int i = 0 ; i < q; i ++){
int x;
scanf("%d" , &x);
int u = dp[x];
if(u >= 1000000000){
printf("oo\n");
}
else{
printf("%d\n" , u);
}
}
}
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... |