Pagini recente » Cod sursa (job #3264661) | Cod sursa (job #1795400) | Cod sursa (job #3273711) | Cod sursa (job #1136909) | Cod sursa (job #514611)
Cod sursa(job #514611)
#include<stdio.h>
#include<stdlib.h>
#define N 100001
typedef struct nod
{long val;
struct nod *leg;}Nod;
typedef struct
{Nod *prim,*ultim;}coada;
void init(coada &q)
{q.prim=q.ultim=NULL;}
void add(long x,coada &q)
{Nod *px=new Nod;
px->val=x;
px->leg=NULL;
if(q.prim==NULL)
q.prim=q.ultim=px;
else
{q.ultim->leg=px;
q.ultim=px;}}
long del(coada &q)
{Nod *t=q.prim->leg;
long x=q.prim->val;
free(q.prim);
q.prim=t;
if(q.prim==NULL)
q.ultim=NULL;
return x;}
int main()
{long n,m,s,k,i,j,a1[N],a2[N],dist[N],c[N];
coada q;
init(q);
freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
scanf("%ld%ld%ld",&n,&m,&s);
for(k=1;k<=m;k++)
scanf("%ld%ld",&a1[k],&a2[k]);
dist[s]=0;
c[s]=1;
add(s,q);
for(i=1;i<=n;i++)
{dist[i]=N;
c[i]=0;}
while(q.prim!=NULL)
{i=del(q);
for(j=1;j<=n;j++)
if(a1[k]==i&&a2[k]==j&&c[j]==0)
{dist[j]=dist[i]+1;
c[j]=1;
add(j,q);}}
for(i=1;i<=n;i++)
if(dist[i]==N)
printf("-1 ");
else
printf("%ld ",dist[i]);
fclose(stdin);
fclose(stdout);
return 0;}