Pagini recente » Cod sursa (job #3255043) | Cod sursa (job #1098060) | Cod sursa (job #537217) | Cod sursa (job #2358591) | Cod sursa (job #391968)
Cod sursa(job #391968)
#include<stdio.h>
#include<stdlib.h>
int deg[100005],*vec[100005],q[1000005];
void BFS(int st)
{
int u,p,j;
u=0;
p=1;
deg[st]=0;
q[0]=st;
while(u<p)
{
for(j=1;j<vec[q[u]][0];++j)
{
if(deg[vec[q[u]][j]]<0)
{
q[p]=vec[q[u]][j];
deg[q[p++]]=deg[q[u]]+1;
}
}
++u;
}
}
int main()
{
freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
int n,m,s,ax1,ax2,i;
scanf("%d%d%d",&n,&m,&s);
for(i=0;i<m;++i)
{
scanf("%d%d",&ax1,&ax2);
if(ax1!=ax2)
++deg[ax1];
}
freopen("bfs.in","r",stdin);
scanf("%d%d%d",&n,&m,&s);
for(i=1;i<=m;++i)
{
scanf("%d%d",&ax1,&ax2);
if(deg[ax1]>0)
{
//vec[ax1]=new int[deg[ax1]+1];
vec[ax1]=(int *)malloc((deg[ax1]+1)*sizeof(int));
vec[ax1][0]=1;
vec[ax1][vec[ax1][0]++]=ax2;
deg[ax1]=-1;
}
else
if(ax1!=ax2)
vec[ax1][vec[ax1][0]++]=ax2;
}
BFS(s);
for(i=1;i<=n;++i)
printf("%d ",deg[i]);
return 0;
}