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> //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;
int n,m,ans[20000005],a[20000005];
int32_t main(){
CODE_START
n=2e7;
cin>>m;
int q;
cin>>q;
for(int i=1;i<=m;i++)
{
int x;
cin>>x;
for(int j=x;j<=n;j+=x){
a[j-1]=max(a[j-1],x-1);
}
}
for(int i=n;i>=1;i--)
{
a[i]=max(a[i],a[i+1]-1);
}
for(int 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--){
int x;
cin>>x;
if(ans[x]){
cout<<ans[x]<<endl;
}else cout<<"oo"<<endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |