Pagini recente » Rating Albu Diana (diana.albu) | Cod sursa (job #2087433) | Rating Alexandra Corduneanu (Alexandra_Corduneanu) | Cod sursa (job #2213885) | Cod sursa (job #1184102)
#include <fstream>
#include <cstdio>
#include <vector>
#include <queue>
using namespace std;
ofstream fout("bfs.out");
int n, m , s ;
vector <int> V[100001] ;
int uz[1000001] ;
vector <int > C ;
void citire();
void bfs(int);
void afisare();
int main()
{
citire();
bfs(s);
afisare();
return 0;
}
void citire()
{
int i, x, y ;
freopen("bfs.in", "r", stdin);
scanf("%d %d %d", &n, &m, &s);
for ( i = 1 ; i <= m ; i++)
{
scanf( "%d %d", &x , &y) ;
V[x].push_back(y) ;
}
}
void bfs( int k )
{
int x, i, ic = 0 ;
C.push_back(k);
uz[k] = 1 ;
while ( ic < C.size())
{
x = C[ic++];
for ( i = 0 ; i < V[x].size(); i++)
{
if ( uz[V[x][i]] == 0)
{
C.push_back(V[x][i]);
uz[V[x][i]] = uz[x] + 1 ;
}
}
}
}
void afisare()
{
int i ;
for ( i = 1 ; i <= n ; i++)
{
if ( uz[i] == 0 ) fout << "-1 " ;
else
fout << uz[i] - 1 << " " ;
}
fout << '\n' ;
}