제출 #863956

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
863956		MilosMilutinovic	Spiderman (COCI20_spiderman)	C++14	70 / 70	49 ms	12368 KiB

spiderman

#include<bits/stdc++.h>

#define pb push_back
#define fi first
#define se second
#define mp make_pair

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef long double ld;

template <typename T> bool chkmin(T &x,T y){return x>y?x=y,1:0;}
template <typename T> bool chkmax(T &x,T y){return x<y?x=y,1:0;}

int readint(){
	int x=0,f=1; char ch=getchar();
	while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
	while(ch>='0'&&ch<='9'){x=x*10+ch-'0';ch=getchar();}
	return x*f;
}

int n,k,h[300005],cnt[1000005],ans[1000005];

int main(){
	n=readint(); k=readint();
	for(int i=1;i<=n;i++) h[i]=readint();
	for(int i=1;i<=n;i++) cnt[h[i]]++;
	for(int x=k+1;x<=1000000;x++){
		ans[k]+=cnt[x];
		for(int y=x;y+k<=1000000;y+=x) ans[y+k]+=cnt[x];
		if(k==0) ans[x]--;
	}
	for(int i=1;i<=n;i++) printf("%d ",ans[h[i]]);
	return 0;
}

• Subtask 1: 70 / 70