Pagini recente » Cod sursa (job #557858) | Cod sursa (job #2702682) | Cod sursa (job #1373197) | Cod sursa (job #2726208) | Cod sursa (job #2357003)
#include <bits/stdc++.h>
#define NMAX 100005
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> v[NMAX];
vector <int> Q;
int D[NMAX],Prez[NMAX];
int p,u;
void BFS(int x)
{
int i,nc;
Q.push_back(x);
p=0;
u=0;
D[x]=0;
Prez[x]=1;
while(p<=u)
{
nc=Q[p];
p++;
for(auto i : v[nc])
{
if(Prez[i]==0) Prez[i]=1,D[i]=D[nc]+1,Q.push_back(i),u++;
}
}
}
int main()
{
int n,m,S,i,x,y;
fin>>n>>m>>S;
for(i=1;i<=m;++i)
{
fin>>x>>y;
v[x].push_back(y);
}
BFS(S);
for(i=1;i<=n;++i,fout<<" ")
if(Prez[i]==1)fout<<D[i];
else fout<<"-1";
return 0;
}