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 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;
}
p=v[v.size()-1]-1;
pp=v[v.size()-1]-1;
cnt=1;
for(int i=1;i<=M;++i)
{
if(i<=p)
{
if(d[i]!=0)pp=max(pp,i+d[i]-1);
d[i]=cnt;
if(i==p)
{
p=pp;
cnt++;
}
}
else {mx=i-1;break;}
}
while(q--)
{
cin>>x;
if(mx<x)cout<<"oo\n";
else cout<<d[x]<<"\n";
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |