Pagini recente » Cod sursa (job #1200704) | Cod sursa (job #2434225) | Cod sursa (job #2434222) | Cod sursa (job #2838887) | Cod sursa (job #3314317)
#include <bits/stdc++.h>
using namespace std;
const int N = 100000 + 5;
vector<int> g[N];
int d[N];
int n, m, s;
int main() {
ios::sync_with_stdio(false);
cin.tie(nullptr);
freopen("bfs.in", "r", stdin);
freopen("bfs.out", "w", stdout);
cin >> n >> m >> s;
for (int i = 0; i < m; i++) {
int x, y;
cin >> x >> y;
g[x].push_back(y);
}
fill(d + 1, d + n + 1, -1);
queue<int> q;
d[s] = 0;
q.push(s);
while (!q.empty()) {
int u = q.front(); q.pop();
for (int v : g[u]) {
if (d[v] == -1) {
d[v] = d[u] + 1;
q.push(v);
}
}
}
for (int i = 1; i <= n; i++)
cout << d[i] << " ";
return 0;
}