Submission #1234344

#	Time	Username	Problem	Language	Result	Execution time	Memory
1234344		PlayVoltz	Birmingham (COCI20_birmingham)	C++20	15 / 70	47 ms	10308 KiB

birmingham

#include <cstdio>
#include <stdio.h>
#include <stdbool.h>
#include <iostream>
#include <map>
#include <vector>
#include <climits>
#include <stack>
#include <string>
#include <queue>
#include <algorithm>
#include <set>
#include <unordered_set>
#include <unordered_map>
#include <cmath>
#include <cctype>
#include <bitset>
#include <iomanip>
#include <cstring>
#include <numeric>
#include <cassert>
#include <random>
#include <chrono>
#include <fstream>
using namespace std;

#define int long long
#define pii pair<int, int>
#define mp make_pair
#define pb push_back
#define fi first
#define se second

int32_t main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	int n, m, q, k, a, b;
	cin>>n>>m>>q>>k;
	vector<int> dj(n+1, LLONG_MAX/2);
	vector<vector<int> > graph(n+1);
	queue<int> pq;
	while (q--){
		cin>>a;
		dj[a]=0;
		pq.push(a);
	}
	while (m--){
		cin>>a>>b;
		graph[a].pb(b);
		graph[b].pb(a);
	}
	while (pq.size()){
		int node=pq.front();
		pq.pop();
		for (auto num:graph[node])if (dj[num]==LLONG_MAX/2)dj[num]=dj[node]+1, pq.push(num);
	}
	for (int i=1; i<=n; ++i)cout<<(dj[i]+k-1)/k<<" ";
}

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