#include <bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define sz(a) (int)a.size()
#define all(a) a.begin(),a.end()
#define rep(i,n) for(int i=0;i<n;i++)
#define crep(i,x,n) for(int i=x;i<n;i++)
#define drep(i,n) for(int i=n-1;i>=0;i--)
#define vec(...) vector<__VA_ARGS__>
#define _3qplfh5 ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
using pii=pair<int,int>;
using vi=vector<int>;
using vll=vector<long long>;
const int _n=1e6+10;
int main(){
_3qplfh5;
int n,k;
cin>>n>>k;
vi a(n);
rep(i,n){
cin>>a[i];
}
int ma=*max_element(all(a));
vi cnt(_n);
rep(i,n){
cnt[a[i]]++;
}
vi oa=a;
sort(all(a));
a.erase(unique(all(a)),a.end());
vi pans(_n,0);
rep(i,sz(a)){
int ai=a[i];
if(ai<=k) continue;
int x=0;
while(x<=ma){
if(x+k<=ma){
pans[x+k]+=cnt[ai];
}
x+=ai;
}
}
rep(i,n){
cout<<pans[oa[i]]<<" ";
}
cout<<"\n";
//
return 0;
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
7 ms |
8140 KB |
Output is correct |
| 2 |
Correct |
8 ms |
8140 KB |
Output is correct |
| 3 |
Correct |
28 ms |
9192 KB |
Output is correct |
| 4 |
Correct |
65 ms |
11444 KB |
Output is correct |
| 5 |
Incorrect |
41 ms |
9068 KB |
Output isn't correct |
| 6 |
Incorrect |
82 ms |
11332 KB |
Output isn't correct |
| 7 |
Correct |
34 ms |
9060 KB |
Output is correct |
| 8 |
Correct |
36 ms |
9060 KB |
Output is correct |
| 9 |
Correct |
84 ms |
11176 KB |
Output is correct |
| 10 |
Correct |
81 ms |
11332 KB |
Output is correct |
