Pagini recente » Cod sursa (job #1809676) | Cod sursa (job #1120295) | Monitorul de evaluare | Istoria paginii runda/preoji2010_runda1/clasament | Cod sursa (job #1814374)
#include <stdio.h>
#include <stdlib.h>
#define MAXN 1000001
int ind[MAXN],viz[MAXN],next[MAXN],y[MAXN],cod[MAXN];
void BFS(int nod){
int x,b=0,e=1,x1;
viz[nod]=1;
cod[b]=nod;
do{
x=ind[cod[b]];
x1=cod[b++];
while(x>0){
if(viz[y[x]]==0){
viz[y[x]]=viz[x1]+1;
cod[e++]=y[x];
}
x=next[x];
}
}while(b<e);
}
int main(){
FILE*fi,*fout;
int i,j,n,m,s,nr,x,p=1;
fi=fopen("bfs.in" ,"r");
fout=fopen("bfs.out" ,"w");
fscanf(fi,"%d%d%d" ,&n,&m,&s);
for(i=1;i<=m;i++){
fscanf(fi,"%d%d" ,&x,&y[p]);
if(x!=y[p]){
next[p]=ind[x];
ind[x]=p;
p++;
}
}
BFS(s);
for(i=1;i<=n;i++)
fprintf(fout,"%d " ,viz[i]-1);
fclose(fi);
fclose(fout);
return 0;
}