제출 #440627

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
440627		Wasif_Jamil	Spiderman (COCI20_spiderman)	C++17	0 / 70	2091 ms	124084 KiB

spiderman

#include<bits/stdc++.h>
using namespace std;
vector<int>divisors[1000001];

int main(){
	for(int i=1; i<=1000000; i++){
		for(int j=i; j<=1000000; j+=i){
			divisors[j].push_back(i);
		}
	}
	int n, k; 
	cin >> n >> k;
	vector< pair<int, int> >v(n);
	unordered_map<int, int>mp;
	for(int i=0; i<n; i++){
		cin >> v[i].first;
		v[i].second = i;
		mp[v[i].first]++;
	}
	sort(v.begin(), v.end());
	vector<int>d(n);
	for(int i=0; i<n; i++){
		//cout << v[i] << '\n';
		int val = v[i].first - k;
		if(val <= 0){
			if(k == v[i].first){
				d[v[i].second] = n-i-1;
			}else {
				d[v[i].second] = 0;
			}
		}
		else {
			int ans = 0;
			for(int e:divisors[val]){
				if(e==k)continue;
				ans += mp[e];
			}
			d[v[i].second] = ans;
		}
	}
	for(int e:d)cout << e << " ";
	return 0;
}

• Subtask 1: 0 / 70