Cod sursa(job #524638)

Utilizator soare_cristian16Cristy93 soare_cristian16 Data 22 ianuarie 2011 15:10:57
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include<fstream>
#include<vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
const int M=100001;
vector<int> v[M];
int n,m,a[M],d[M],s;
void bfs(int s)
{
	int st,dr,i;
	st=dr=1;
	d[st]=s;
	a[s]=0;
	while(st<=dr)
	{
		for(i=0;i<v[d[st]].size();i++)
		{
			if(a[v[d[st]][i]]==-1)
			{
				d[++dr]=v[d[st]][i];
				a[v[d[st]][i]]=a[d[st]]+1;
			}
		}
		st++;
	}
}
int main()
{
	int i,x,y;
	f>>n>>m>>s;
	for(i=1;i<=m;i++)
	{
		f>>x>>y;
		v[x].push_back(y);
	}
	memset(a,-1,sizeof(a));
	bfs(s);
	for(i=1;i<=n;i++)
		g<<a[i]<<' ';
	return 0;
}