Pagini recente » Cod sursa (job #2095898) | Cod sursa (job #1372882) | Cod sursa (job #798555) | Cod sursa (job #1876984) | Cod sursa (job #1758034)
#include <fstream>
#include <vector>
using namespace std;
ofstream fout("bfs.out");
ifstream fin("bfs.in");
vector <int> v[100001];
int n,m,s,x,y,viz[100005];
int bfs(int x)
{
int i,k=0,j;
int q[100001]={0};
q[1]=x;
k++;
viz[x]=-1;
for(i=1;i<=k;i++)
{
for(j=0;j<v[q[i]].size();j++)
{
if(viz[v[q[i]][j]]==0)
{
q[++k]=v[q[i]][j];
if(viz[q[i]]!=-1) viz[q[k]]=viz[q[i]]+1;
else viz[q[k]]=viz[q[i]]+2;
}
}
}
}
int main()
{
fin>>n>>m>>s;
for(int i=1; i<=m; i++)
{
fin>>x>>y;
v[x].push_back(y);
}
bfs(s);
for(int i=1;i<=n;i++)
{
if((viz[i]==0)&&(i!=s))
{
fout<<-1<<' ';
}
else if(i==s)
{
fout<<0<<' ';
}
else
{
fout<<viz[i]<<' ';
}
}
return 0;
}