Cod sursa(job #642582)

Utilizator johnny2008Diaconu Ion johnny2008 Data 1 decembrie 2011 19:08:37
Problema BFS - Parcurgere in latime Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include<fstream>
#include<iostream>
using namespace std;
int vec[10000][5000];
bool viz[100001];
int n,m,s;
int q[100001];
int dist[100001];
int d=0;
int main(){
	ifstream f("bfs.in");
	ofstream g("bfs.out");
	f>>n>>m>>s;
	int i,j,a,b;
	for(i=1;i<=m;i++){
		
		f>>a>>b;
		vec[a][0]++;
		vec[a][vec[a][0]]=b;
	}
	
	int fi=1;
	q[0]=1;
	q[1]=s;
	viz[s]=true;
	dist[s]=0;
	while(fi<=q[0]){
		d++;
		a=q[fi];
		
		for(i=1;i<=vec[a][0];i++){
			if(viz[vec[a][i]]==false){
				viz[vec[a][i]]=true;
				q[0]++;
				q[q[0]]=vec[a][i];
				dist[vec[a][i]]=d;
			}
		}
		fi++;
	}
	for(i=1;i<=n;i++){
		if(dist[i]==0 && i!=s){
			g<<"-1 ";
		}
		else{
			g<<dist[i]<<" ";
		}
	}
	g<<"\n";
	return 0;
}