Pagini recente » Cod sursa (job #3001744) | Cod sursa (job #1436439) | Cod sursa (job #1875775) | Cod sursa (job #2698826) | Cod sursa (job #1183509)
//#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> A[100010];
int G[100010], S[100010], C[100010];
int main()
{
int i,x,y,n,m,k,j,nod;
fin>>n>>m>>nod;
for (i=1;i<=m;i++)
{
fin>>x>>y;
A[x].push_back(y);
}
for (i=1;i<=n;i++)
G[i]=A[i].size();
for(i=1;i<100005;i++)
C[i]=-1;
k=1;
C[nod]=0;
S[1]=nod;
for(i=1;i<=k;i++)
for(j=0;j<G[S[i]];j++)
if(C[A[S[i]][j]]==-1)
{
S[++k]=A[S[i]][j];
C[S[k]]=C[S[i]]+1;
}
for (i=1;i<=n;i++)
fout<<C[i]<<' ';
fout<<'\n';
return 0;
}
//nigga