Cod sursa(job #367899)

Utilizator dead_knightTitei Paul Adrian dead_knight Data 23 noiembrie 2009 18:31:50
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include<fstream>
#include<cstdlib>
using namespace std;
#define MAX 100001
int n,* a[MAX],s,d[MAX];

void read(){
	ifstream fin("bfs.in");
	int m;
	fin>>n>>m>>s;
    for(int i=1;i<=n;i++){
	     a[i]=(int *) malloc(1 * sizeof(int));
		 a[i][0]=0;
		 d[i]=-1; }
	for(;m;--m){
	    int i,j;
		fin>>i>>j;
		a[i]=(int *) realloc(a[i], (a[i][0]+2)*4);
		a[i][0]++;
		a[i][a[i][0]]=j;
	}
	fin.close();

}
void bfs(){
    int *coada=new int[n+1],st=1,dr=1,k,i;
	coada[1]=s;
	d[s]=0;
	while(st<=dr)
	{
		k=coada[st++];
		for(i=1;i<=a[k][0];i++)
		    if(d[a[k][i]]==-1)
			   {
				   coada[++dr]=a[k][i];
				   d[a[k][i]]=d[k]+1;
				}
	}
}
void write(){
	ofstream fout("bfs.out");
	for(int i=1;i<=n;i++)
	    fout<<d[i]<<" ";
	fout.close();
}

int main()
{
	read();
	bfs();
	write();
    return 0;
}