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>
#define FAST ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);cerr.tie(0)
#define mp make_pair
#define xx first
#define yy second
#define pb push_back
#define pf push_front
#define popb pop_back
#define popf pop_front
#define all(x) x.begin(),x.end()
#define ff(i,a,b) for (int i = a; i < b; i++)
#define fff(i,a,b) for (int i = a; i <= b; i++)
#define bff(i,a,b) for (int i = b-1; i >= a; i--)
#define bfff(i,a,b) for (int i = b; i >= a; i--)
using namespace std;
long double typedef ld;
unsigned int typedef ui;
long long int typedef li;
pair<int,int> typedef pii;
pair<li,li> typedef pli;
pair<ld,ld> typedef pld;
vector<vector<int>> typedef graph;
unsigned long long int typedef ull;
//const int mod = 998244353;
const int mod = 1000000007;
//Note to self: Check for overflow
const int N=10'000'000;
int dp[N+7];
int lud[N+7]; //largest divisor
int main()
{
FAST;
int m,q; cin>>m>>q;
vector<int> prost(m);
ff(i,0,m) cin>>prost[i];
fff(i,1,N) dp[i]=mod;
for (auto p : prost)
{
for (int i=0;i<=N/p;i++) lud[i*p]=p;
}
int dokle0=-1,dokle1=-1,okle=0;
fff(i,0,N)
{
if (i)
{
if (dokle0>=i) dp[i]=dp[i-1];
else
{
if (dokle1>=i) dp[i]=dp[i-1]+1;
{
dokle0=dokle1,dokle1=-1;
}
}
}
dokle1=max(dokle1,i+lud[i]-1);
}
//fff(i,0,10) cout<<i<<": "<<dp[i]<<endl;
while (q--)
{
int nj; cin>>nj;
if (dp[nj]>N+3) cout<<"oo\n";
else cout<<dp[nj]<<"\n";
}
}
//Note to self: Check for overflow
Compilation message (stderr)
brunhilda.cpp: In function 'int main()':
brunhilda.cpp:57:29: warning: unused variable 'okle' [-Wunused-variable]
57 | int dokle0=-1,dokle1=-1,okle=0;
| ^~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |