Pagini recente » Cod sursa (job #752938) | Cod sursa (job #2729469) | Cod sursa (job #92933) | Cod sursa (job #2271570) | Cod sursa (job #250906)
Cod sursa(job #250906)
#include<stdio.h>
#define N 100005
#define M 1000005
int *a[N];
int viz[N],n,m,d[N],x[M],y[M],s;
void bfs(int x0)
{
int coada[N],x,y,u=0,p=0;
for (int i=1; i<=n; ++i) d[i]=-1;
coada[u++]=x0;
viz[x0]=1;
d[x0]=0;
while (u!=p)
{
x=coada[p++];
for (int i=1; i<=a[x][0]; ++i)
{
y=a[x][i];
if (!viz[y])
{
coada[u++]=y;
viz[y]=1;
d[y]=1+d[x];
}
}
}
}
void citire()
{
freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
scanf("%d%d%d",&n,&m,&s);
for (int i=1; i<=m; ++i)
{
scanf("%d%d",&x[i],&y[i]);
++d[x[i]];
}
for (int i=1; i<=n; ++i)
{
a[i]=new int (1+d[i]);
a[i][0]=0;
}
for (int i=1; i<=m; ++i)
a[x[i]][++a[x[i]][0]]=y[i];
bfs(s);
for (int i=1; i<=n; ++i)
printf("%d ",d[i]);
}
int main()
{
citire();
return 0;
}