Submission #845246

#	Time	Username	Problem	Language	Result	Execution time	Memory
845246		vjudge1	Birmingham (COCI20_birmingham)	C++17	70 / 70	122 ms	8904 KiB

birmingham

#include <bits/stdc++.h>
#define pb push_back
using namespace std;

constexpr static int MXN = 1e5;

int n, m, k, q;
bitset<MXN> visited;

vector<int> g[MXN];
vector<int> v;
int vv[MXN];
int res[MXN];

int main()
{
	cin >> n >> m >> q >> k;
	for (int i = 0; i < q; i++)
	{
		int val;
		cin >> val;
		v.pb(val-1);
	}
	for (int i = 0; i < m; i++)
	{
		int a, b;
		cin >> a >> b;
		a--,b--;
		g[a].pb(b);
		g[b].pb(a);
	}
	for (int i : v)
		visited[i] = true;
	int j = 1;
	while (!v.empty())
	{
		queue<array<int, 2>> t;
		for (int i : v)
			t.push({i, j*k});
		v.clear();
		while (t.size())
		{
			auto [node, s] = t.front();
			t.pop();
			if (s != j*k)
				res[node] = j;
			if (s == 0)
			{
				v.pb(node);
				continue;
			}
			for (int c : g[node])
			{
				if (!visited[c])
				{
					t.push({c, s-1});
					visited[c] = true;
				}
			}
		}
		j++;
	}
	for (int i = 0; i < n; i++)
		cout << res[i] << " ";
	cout << "\n";
}

• 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