제출 #845131

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
845131		vjudge1	Birmingham (COCI20_birmingham)	C++17	70 / 70	83 ms	11268 KiB

birmingham

#include <bits/stdc++.h>
#define fast cin.tie(0)->sync_with_stdio(0);
#define int long long
#define inf ((int)1e18)
#define N 100005
using namespace std;
bool vis[N];
int way[N];
vector <vector<int> > adj(N);

int32_t main(){
	fast
	int n, m, q, k;
	cin>>n>>m>>q>>k;
	queue <pair<int, int> > que;
	for(int i = 0; i < q; i++) {
		int in;
		cin>>in;
		que.push({in, 0});
		vis[in] = 1;
	}
	for(int i = 0; i < m; i++) {
		int a, b;
		cin>>a>>b;
		adj[a].push_back(b);
		adj[b].push_back(a);
	}
	while(!que.empty()) {
		int node = que.front().first, dis = que.front().second;
		way[node] = dis;
		que.pop();
		for(auto it:adj[node]) {
			if(vis[it]) continue;
			vis[it] = 1;
			que.push({it, dis + 1});
		}
	}
	for(int i = 1; i <= n; i++) {
		int val = 0, tk = k;
		while(way[i] > 0) {
			way[i] -= tk;
			tk 	+= k;
			val++; 
		}
		cout<<val<<" ";
	}
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5