Cod sursa(job #367870)

Utilizator mihainexMihai Nechita mihainex Data 23 noiembrie 2009 17:58:58
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include<fstream>
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]=new int[n+1],d[i]=-1;
	for(;m;--m)
	    {
			int i,j;
			fin>>i>>j;
			a[i][j]=1;
		}
	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<=n;i++)
		    if(a[k][i]==1&&d[i]==-1)
			    {
					coada[++dr]=i;
					d[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;
}