Cod sursa(job #700277)

Utilizator alyn_acalin alin alyn_ac Data 1 martie 2012 08:55:43
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include<iostream>
#include<fstream>
#include<vector>
#define nmax 100001

using namespace std;
int n,m,s;

vector <int> v[nmax];
ifstream f("bfs.in");
ofstream fout("bfs.out");
int citire()
{
	int x,y;
	f>>n>>m>>s;
	while(f>>x>>y)
	{
		v[x].push_back(y);
	}
}	
void bfs()
{
	int viz[nmax],c[nmax],i,x,y,p;
	for(i=1;i<=n;i++)
		viz[i]=-1;
	x=y=1;
	viz[s]=0;
	c[x]=s;
	while(x<=y)
	{
		p=c[x];x++; 
		for(i=0;i<v[p].size();i++)
		{
			if(viz[v[p][i]]==-1)
			{
				y++;
				c[y]=v[p][i];
				viz[v[p][i]]=viz[p]+1;
			}
		}
	}
	for(i=1;i<=n;i++)
		fout<<viz[i]<<' ';
}

int main()
{
int i,x,s;
citire();
/*for(x=1;x<=n;x++)
{
	for(i=0;i<v[x].size();i++)
{
	cout<<v[x][i];
	
}
cout<<endl;*/
bfs();
return 0;
}