Cod sursa(job #781089)

Utilizator ionicaion ionica Data 23 august 2012 11:16:48
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.55 kb
#include<fstream>
#include<vector>
#define maxn 100001
using namespace std;
int viz[maxn],c[maxn],p,u,n,m,LG[maxn];
vector <int> B[maxn];


int main()
{
ifstream f("bfs.in");
ofstream g("bfs.out");
int i,x,y,s,z,w;
f>>n>>m>>s;
for(i=1;i<=m;i++)
{
	f>>x>>y;
	B[x].push_back(y);
}
for(i=1;i<=n;i++)
	LG[i]=B[i].size();

c[1]=s; p=u=1;
viz[s]=1;
while(p<=u)
{
	z=c[p];p++;
	for(i=0;i<LG[z];i++)
	{
		w=B[z][i];
		if(!viz[w])
		{
			u++;
			c[u]=w;
			viz[w]=viz[z]+1;
		}
	}
}
for(i=1;i<=n;i++)
	g<<viz[i]-1<<' ';
return 0;
}