Submission #31878

#TimeUsernameProblemLanguageResultExecution timeMemory
31878KanvieBrunhilda’s Birthday (BOI13_brunhilda)C++14
5.56 / 100
419 ms41928 KiB
#include<bits/stdc++.h>
using namespace std;
const int M=10000000;
int x,m,q,d[M+1],mx,p,pp,cnt;
vector<int>v;
int main()
{
    cin>>m>>q;
    while(m--)
    {
        cin>>x;
        v.push_back(x);
    }
    sort(v.begin(),v.end());
    m=v.size();
    for(int i=0;i<m;++i)
    {
        x=v[i];
        for(int j=0;j<=M;j+=x)d[j]=x;
    }
    for(int i=0;i<=M;++i)
    {
        while(i<=p)
        {
            if(d[i]!=0)pp=max(pp,i+d[i]-1);
            d[i]=cnt;
            if(i==p)break;
            i++;
        }
        if(i==pp){mx=i;break;}
        p=pp;
        ++cnt;
    }
    while(q--)
    {
        cin>>x;
        if(mx<x)cout<<"oo\n";
        else cout<<d[x]<<"\n";
    }
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...