Cod sursa(job #1094340)

Utilizator BLz0rDospra Cristian BLz0r Data 29 ianuarie 2014 12:04:02
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include <cstdio>
#include <vector>
#include <cstring>
using namespace std;

FILE *f=fopen ("bfs.in","r");
FILE *g=fopen ("bfs.out","w");

vector<int>v[100005];
int n,m,q[100005],cost[100005],lg[100005];


void bfs(int start){
	int L=0;
	memset(cost,-1,sizeof(cost));
	
	cost[start]=0;
	q[++L]=start;
	
	for (int i=1;i<=L;++i){
		for (int j=0;j<lg[q[i]];++j){
			if (cost[v[q[i]][j]]== -1){
				q[++L]=v[q[i]][j];
				cost[q[L]]=cost[q[i]]+1;
			}
		}
	}
	
}

int main(){
	int x,y,s;
	
	fscanf (f,"%d%d%d",&n,&m,&s);
	
	for (int i=1;i<=m;++i){
		fscanf (f,"%d%d",&x,&y);
		v[x].push_back(y);
	}
	
	for (int i=1;i<=n;++i) lg[i]=v[i].size();
	
	bfs(s);
	
	for (int i=1;i<=n;++i) fprintf (g,"%d ",cost[i]);
	
	return 0;
}