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+5],a[M+5],b[M+5],p,pp,cnt;
int main()
{
cin>>m>>q;
for(int i=1;i<=m;++i)cin>>a[i];
for(int i=1;i<=m;++i)
for(int j=0;j<=M;j+=a[i])d[j]=max(d[j],a[i]);
for(int i=0;i<=M;++i)
{
while(i<=p&&i<=M)
{
if(d[i]!=0)pp=max(pp,i+d[i]-1);
b[i]=cnt;
if(i==p)break;
i++;
}
if(i==pp)break;
p=pp;
++cnt;
}
while(q--)
{
cin>>x;
if(b[x]==0&&x!=0)cout<<"oo\n";
else cout<<b[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... |