Pagini recente » Cod sursa (job #2522031) | Cod sursa (job #172786) | Cod sursa (job #2837140) | Cod sursa (job #2799780) | Cod sursa (job #1185804)
#include <fstream>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int a[22001][22001],n,m,s,i,p,u,c[200001],viz[200001],x,y;
int main()
{
fin>>n>>m>>s;
for(i=1;i<=m;i++)
{
fin>>x>>y;
a[x][y]=1;
}
p=u=1;
c[p]=s;
viz[s]=1;
while(u<=p)
{
for(i=1;i<=n;i++)
{
if(a[c[u]][i] && viz[i]==0)
{
p++;
c[p]=i;
viz[i]=viz[c[u]]+1;
}
}
u++;
}
for(i=1;i<s;i++)
{
if(viz[i]==0)
fout<<-1<<" ";
else
fout<<viz[i]-1<<" ";
}
fout<<0<<" ";
for(i=s+1;i<=n;i++)
{
if(viz[i]==0)
fout<<-1<<" ";
else
fout<<viz[i]-1<<" ";
}
return 0;
}