Cod sursa(job #367894)

Utilizator xpawnripsterge contu asta xpawnrip Data 23 noiembrie 2009 18:26:56
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include<fstream>
#include<iostream>
#include<cstdlib;>
using namespace std;
#define MAX 100001
int n,*a[MAX], d[100001],s;

void read()
{
	ifstream fin("bfs.in");
	int m;
	fin>>n>>m>>s;
	
	for(int i=1;i<=n;i++)
	{
		a[i]=(int *)mallloc(1*sizeof(int));
		a[i][0]=0;		d[i]=-1;
	}	
	for(;m;--m)
	{
		fin>>i>>j;
		a[i]=(int *)realloc(a[i],(a[i][0]+2))*sizeof(int));
		a[i][++a[i][0]]=j;
	}
	fin.close();
}
void bfs()
{
	int *coada=new int[n+1];
	int st=1,dr=1,k,i;
	coada[dr]=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;
}