Submission #331145

#TimeUsernameProblemLanguageResultExecution timeMemory
331145Sho10Brunhilda’s Birthday (BOI13_brunhilda)C++14
0 / 100
711 ms158188 KiB
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
ll n,m,ans[20000001],a[20000001];
int32_t main(){
CODE_START
n=2e7;
cin>>m;
ll q;
cin>>q;
for(ll i=1;i<=m;i++)
{
    ll x;
    cin>>x;
    for(ll j=x;j<=n;j+=x){
        a[j-1]=max(a[j-1],x-1);
    }
}
for(ll i=n;i>=1;i--)
{
    a[i]=max(a[i],a[i+1]-1);
}
for(ll i=1;i<=m;i++)
{
    if(a[i]&&(ans[i-a[i]]||i-a[i]==0)){
        ans[i]=ans[i-a[i]]+1;
    }
}
while(q--){
    ll x;
    cin>>x;
    if(ans[x]){
        cout<<ans[x]<<endl;
    }else cout<<"oo"<<endl;
}
}

#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...