Pagini recente » Cod sursa (job #827264) | Cod sursa (job #3186152) | Cod sursa (job #2318688) | Cod sursa (job #1322992) | Cod sursa (job #2701852)
#include <bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
// #define f cin
// #define g cout
vector<int> v[100009];
int n, m, s, rez[100009];
queue<int> q;
int32_t main()
{
ios_base::sync_with_stdio(false);
f.tie(nullptr);
g.tie(nullptr);
f >> n >> m >> s;
for (int x, y; m; m--)
f >> x >> y, v[x].emplace_back(y);
rez[s] = 1;
q.push(s);
while (!q.empty())
{
int ac = q.front();
q.pop();
for (const auto &i : v[ac])
if (!rez[i])
rez[i] = rez[ac] + 1, q.push(i);
}
for (int i = 1; i <= n; i++)
g << (!rez[i] ? -1 : rez[i] - 1) << ' ';
return 0;
}