Pagini recente » Cod sursa (job #249154) | Cod sursa (job #3278845) | Cod sursa (job #2251427) | Cod sursa (job #3262824) | Cod sursa (job #2831486)
#include <fstream>
#define mF "bfs"
std::ifstream in(mF ".in");
std::ofstream out(mF ".out");
constexpr int N = 100000; int V[N];
#include <vector>
std::vector<int> F[N];
#include <deque>
int main()
{
int n, m, s; in >> n >> m >> s; while (m--)
{int a, b; in >> a >> b; F[--a].push_back(--b);}
for (std::deque<int> Q = {--s}; Q.size(); Q.pop_front())
for (int back: F[Q.front()]) if (!V[back] and back != s)
Q.push_back(back), V[back] = V[Q.front()] + 1;
for (int i = 0; i < n; i++) out <<
(V[i]? V[i]: i == s? 0: -1) << ' ';
}