Cod sursa(job #701170)

Utilizator AlikingAlin Mogis Aliking Data 1 martie 2012 14:09:27
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include<iostream>
#include<vector>
#include<fstream>
#define nmax 100001
using namespace std;
int n,m,s;
vector <int> v[nmax];
ifstream fin("bfs.in");ofstream fout("bfs.out");
void citire()
{
	int x,y;
	fin>>n>>m>>s;
	
	while(fin>>x>>y)	v[x].push_back(y);
}
void bfs()
{
	int viz[nmax],i,j,c[nmax],p,u;
	p=u=1;
	for(i=0;i<=n;i++)	viz[i]=-1;
	viz[s]++;c[1]=s;
	while(p<=u)
	{
		j=c[p];p++;
	
	for(i=0;i<v[j].size();i++)
	{
		if(viz[v[j][i]]==-1)
		{
			u++;c[u]=v[j][i];viz[v[j][i]]=viz[j]+1;
		}
	}
	}
	for(i=1;i<=n;i++)
		fout<<viz[i]<<' ';
}
int main()
{
	citire();
	bfs();
	return 0;
}