Cod sursa(job #625376)

Utilizator Oancea.CatalinOancea Catalin Oancea.Catalin Data 24 octombrie 2011 14:42:03
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include<fstream>
using namespace std;
#define IN "bfs.in"
#define OUT "bfs.out"
fstream f(IN, ios::in), g(OUT, ios::out);
bool a[10001][10001];
int v[100001], i, n, m, pornire, x, y;
void bfs(int v[100001], int start)
{
	int k, p, u, coada[100001];
	for(i=1; i<=n; i++)
		coada[i]=0;
	v[start]=0;
	coada[1]=start;
	p=u=1;
	while(p<=u)
	{
		for(k=n; k>=1; k--)
		{
			if(a[coada[p]][k]==1 && v[k]==0 && k!=start)
			{
				u++;
				coada[u]=k;
				v[k]=v[coada[p]]+1;
			}
		}
		p++;
	}

}
int main()
{
	f>>n>>m>>pornire;
	for(i=1; i<=m; i++)
	{
		f>>x>>y;
		a[x][y]=1;
	}
	bfs(v, pornire);
	v[pornire]=0;
	for(i=1; i<=n; i++)
	{
		if(v[i]==0 && i!=pornire) g<<"-1 ";
		else g<<v[i]<<" ";
	}
	return 0;
}