Cod sursa(job #554903)

Utilizator drag0s93Mandu Dragos drag0s93 Data 15 martie 2011 10:25:39
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include<stdio.h>
#include<vector>
#define N 1000001

using namespace std;
vector <int> a[N];
int n , x0  , d[N] , pred[N] , coada[N];

void citire()
{
	int x , y , m ;
	for(int i = 0 ; i <= m ; ++i)
	{
		scanf("%d%d",&x,&y);
		a[x].push_back(y);
	}
	for(int i = 0 ; i <= N ; ++i)
		d[i] = -1;
	
}
void bfs()
{
	int p = 0 , u = 0 , x , y ;
	d[x0] = 0;
	coada[u++] = x0;
	while(p != u)
	{
		x = coada[p++];
		for(int i = 0 ; i < a[x].size() ; i++)
		{
			y = a[x][i];
			if(d[y] == -1)
			{
				d[y] = 1 + d[x];
				pred[y] = x ; 
				coada[u++] = y;
			}
		}
	}
}
void afisare()
{
	for(int i = 1 ; i <= n ; ++i)
		printf("%d",d[i]);
}
int main()
{
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	
	
	citire();
	bfs();
	afisare();
	return 0;
}