Cod sursa(job #650105)

Utilizator johnny2008Diaconu Ion johnny2008 Data 17 decembrie 2011 13:20:51
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include<fstream>
#include<iostream>
#include<vector>
using namespace std;
#define pb push_back
vector <int> vec[100001];
bool viz[100001];
int n,m,s;
int q[100001][2];
int dist[100001];
int d=0;
int main(){
	ifstream f("bfs.in");
	ofstream g("bfs.out");
	f>>n>>m>>s;
	int i,a,b;
	for(i=1;i<=m;i++){
		
		f>>a>>b;
		vec[a].pb(b);
	}
	
	int fi=1;
	q[0][0]=1;
	q[1][0]=s;
	q[1][1]=0;
	viz[s]=true;
	dist[s]=0;
	while(fi<=q[0][0]){
		
		a=q[fi][0];
		d=q[fi][1];
		for(i=0;i<vec[a].size();i++){
			if(viz[vec[a][i]]==false){
				viz[vec[a][i]]=true;
				q[0][0]++;
				q[q[0][0]][0]=vec[a][i];
				q[q[0][0]][1]=d+1;
				dist[vec[a][i]]=d+1;
			}
		}
		fi++;
	}
	for(i=1;i<=n;i++){
		if(dist[i]==0 && i!=s){
			g<<"-1 ";
		}
		else{
			g<<dist[i]<<" ";
		}
	}
	g<<"\n";
	return 0;
}