Cod sursa(job #304193)

Utilizator TyberFMI Dogan Adrian Ioan Lucian Tyber Data 11 aprilie 2009 12:53:10
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include<stdio.h>
#include<vector>
using namespace std;
#define nmax 100001
int n,m,st,l;
vector<int>a[nmax];
int g[nmax],s[nmax],c[nmax];
void BF(int);
int main(){
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	scanf("%d %d %d",&n,&m,&st);
	for(int i=1;i<=m;i++){
		int x,y;
		scanf("%d %d",&x,&y);
		a[x].push_back(y);
	}
	for(int i=1;i<=n;i++)
		g[i]=a[i].size();
	BF(st);
	for(int i=1;i<=n;i++)
		printf("%d ",c[i]);
	printf("\n");
	return 0;
}
void BF(int t){
	memset(c,-1,sizeof(c));
	l=1;
	c[t]=0;
	s[l]=t;
	for(int i=1;i<=l;i++)
		for(int j=0;j<=g[s[i]];j++)
			if(c[a[s[i]][j]]==-1){
				l++;
				s[l]=a[s[i]][j];
				c[s[l]]=c[s[i]]+1;
			}
}