Cod sursa(job #408981)

Utilizator cezyGrigore Cezar cezy Data 3 martie 2010 13:11:12
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include<fstream>
#include<vector>
using namespace std;
#define nmax 100005
#define inf 1<<30
vector<int> g[nmax];
int pred[nmax],d[nmax],c[nmax],q[nmax];
int n,m,x,s;
void citire ()
{
	ifstream fin("bfs.in");
	fin>>n>>m>>s;
	int i,a,b;
	for(i=1;i<=m;i++)
		fin>>a>>b,g[a].push_back(b);
	for(i=1;i<=m;i++)
		fin>>c[i];
	fin.close();
}
void bfs(int nod)
{
	int i,inc,sf,k;
	for(i=1;i<=n;i++)
		d[i]=inf;
	q[inc=sf=0]=nod;
	d[nod]=0;
	while(inc<=sf)
	{
		k=c[inc];inc++;
		for(i=0;i<g[k].size();i++)
			if(d[g[k][i]]>d[k]+1)
				pred[g[k][i]]=k,d[g[k][i]]=d[k]+1;
	}
}
void scrie ()
{
	ofstream fout("bfs.out");
	int i;
	for(i=1;i<=n;i++)
		if(d[i]==inf) fout<<-1;
	else
		fout<<d[i]<<' ';
	fout.close();
}
int main ()
{
	citire();
	bfs(s);
	scrie();
}