This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
//WA submission to check if it will TLE or not.
#include <bits/stdc++.h>
using namespace std ;
const int MAX = 1e7 + 5 ;
const int OO = 1e9 ;
int dp[MAX] ;
int d[MAX][8] ;
int sz[MAX] ;
int main()
{
int n , q ;
cin>>n>>q ;
int arr[n] ;
for(int i = 0 ; i < n ; ++i)
{
cin>>arr[i] ;
for(int j = arr[i] ; j < MAX ; j += arr[i])
{
if(j > (int)(1e7))
break ;
d[j][sz[j]] = arr[i] ;
sz[j]++ ;
}
}
dp[0] = 0 ;
for(int i = 1 ; i < MAX ; ++i)
{
dp[i] = 0 ;
for(int j = 0 ; j < sz[i] ; ++j)
dp[i] += d[i][j] / 2;
}
while(q--)
{
int x ;
cin>>x ;
if(dp[x] >= OO)
cout<<"oo\n" ;
else
cout<<dp[x]<<"\n";
}
return 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... |