Pagini recente » Cod sursa (job #1628772) | Clasament Teme Pregatire ACM Unibuc 2014, Anul II | Cod sursa (job #2543746) | Cod sursa (job #2538948) | Cod sursa (job #1295354)
#include <stdio.h>
int const N=1000001;
int const M=100000;
int vf[N],urm[N],lst[N],nr;
int cost[M],q[N],viz[M];
void addEdge(int x,int y)
{
vf[++nr] = y;
urm[nr] = lst[x];
lst[x] = nr;
}
void bfs(int p)
{
int prm=1,ult=1,poz,y;
cost[p] = 0;
viz[p] = true;
q[1] = p;
while(prm<=ult)
{
p = q[prm++];
poz = lst[p];
while(poz!=0)
{
y = vf[poz];
if(cost[y] == 0 && !viz[y])
{
cost[y] = 1 + cost[p];
viz[y] = true;
q[++ult] = y;
}
poz = urm[poz];
}
}
}
int main()
{
int i,n,m,s,x,y;
freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
scanf("%d %d %d",&n,&m,&s);
for(i=1;i<=m;i++)
{
scanf("%d %d",&x,&y);
addEdge(x,y);
}
bfs(s);
for(i=1;i<=n;i++)
{
if(cost[i] == 0 && i!=s) printf("-1 ");
else printf("%d ",cost[i]);
}
return 0;
}