Cod sursa(job #3232147)

Utilizator ClassicalClassical Classical Data 29 mai 2024 09:46:15
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.7 kb
#include <bits/stdc++.h>

using namespace std;

const int N = (int) 1e5 + 7;
int n, m, src, d[N];
vector<int> g[N];

int main() {
#ifdef INFOARENA
	freopen ("bfs.in", "r", stdin);
	freopen ("bfs.out", "w", stdout);
#endif

	cin >> n >> m >> src;
	for (int i = 1; i <= m; i++) {
		int a, b;
		cin >> a >> b;
		g[a].push_back(b);
	}
	for (int i = 1; i <= n; i++) {
		d[i] = -1;
	}
	vector<int> q;
	q.push_back(src);
	d[src] = 0;
	for (int it = 0; it < (int) q.size(); it++) {
		int a = q[it];
		for (auto &b : g[a]) {
			if (d[b] == -1) {
				d[b] = 1 + d[a];
				q.push_back(b);
			}
		}
	}
	for (int i = 1; i <= n; i++) {
		cout << d[i] << " ";
	}
	cout << "\n";

	return 0;
}