Cod sursa(job #786534)
#include <fstream>
#include <iostream>
#include <vector>
#include <queue>
#include <stdio.h>
using namespace std;
vector< vector<unsigned int> > Graph;
vector<int> Cost;
int n, m, s;
void Read(){
freopen("bfs.in", "r", stdin);
scanf("%i%i%i",&n,&m,&s);
Graph.resize(n+1);
for(int i = 1; i <= m; ++i){
int x, y;
scanf("%i%i",&x,&y);
Graph[x].push_back(y);
}
}
void Bfs(){
queue<unsigned int> Que;
Cost.resize(n+1, -1);
Que.push(s);
Cost[s] = 0;
vector<unsigned int>::iterator it;
while(!Que.empty()){
for(it = Graph[Que.front()].begin(); it != Graph[Que.front()].end(); ++it){
if(Cost[*it] == -1){
Que.push(*it);
Cost[*it] = Cost[Que.front()]+1;
}
}
Que.pop();
}
}
void Write(){
freopen("bfs.out", "w", stdout);
for(int i = 1; i <= n; ++i){
printf("%i ",Cost[i]);
}
}
int main(){
Read();
Bfs();
Write();
return 0;
}