Pagini recente » Cod sursa (job #2857454) | Cod sursa (job #1105016) | Cod sursa (job #985570) | Cod sursa (job #2550500) | Cod sursa (job #1224008)
#include <fstream>
#include <list>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
list<int> L[100001];
int n,m,S,s[100001],cd[100001],i,z,ld,ls,val,x,y;
int main()
{
fin>>n>>m>>S;
for (i=1;i<=m;i++)
{
fin>>x>>y;
L[x].push_back(y);
}
cd[1]=S;
s[S]=0;
ls=1;
ld=1;
while (ls<=ld)
{
z=cd[ls];
ls++;
val=s[z]+1;
for (list<int>::iterator it = L[z].begin(); it != L[z].end(); ++it)
{
if (s[*it]==0)
{
ld++;
cd[ld]=*it;
s[*it]=val;
}
}
}
for (i=1;i<=n;i++)
{
if (i==S)
fout<<0<<" ";
else if (s[i]==0)
fout<<-1<<" ";
else
fout<<s[i]<<" ";
}
return 0;
}