제출 #499303

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
499303		inksamurai	Spiderman (COCI20_spiderman)	C++17	70 / 70	95 ms	11472 KiB

spiderman

#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>;

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(ma+1);
	rep(i,n){
		cnt[a[i]]++;
	}
	vi oa=a;
	sort(all(a));
	a.erase(unique(all(a)),a.end());
	vi pans(ma+1,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+k==ai);
			}
			x+=ai;
		}
	}
	rep(i,n){
		cout<<pans[oa[i]]<<" ";
	}
	cout<<"\n";
//	
	return 0;
}

• Subtask 1: 70 / 70