Pagini recente » Cod sursa (job #2848389) | Cod sursa (job #2785971) | Cod sursa (job #1577701) | Cod sursa (job #1865861) | Cod sursa (job #2709273)
#include <bits/stdc++.h>
#define Nmax 100009
using namespace std;
ifstream f("bfs.in"); ofstream g("bfs.out");
int n,m,s,viz[Nmax],Q[Nmax];
vector <int> L[Nmax];
int main()
{ f>>n>>m>>s;
for(int a,b;m;--m) f>>a>>b, L[a].push_back(b);
Q[1]=s; viz[s]=1;
int p=1,u=1;
while(p<=u)
{ int i=Q[p++],sf=L[i].size();
for(int j=0;j<sf;++j)
if(!viz[L[i][j]])
{viz[L[i][j]]=viz[i]+1; Q[++u]=L[i][j];}
}
for(int i=1;i<=n;i++) g<<viz[i]-1<<' ';
g.close(); return 0;
}