Cod sursa(job #524326)

Utilizator paul992Cirstean Paul paul992 Data 20 ianuarie 2011 22:47:34
Problema BFS - Parcurgere in latime Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.66 kb
#include <stdio.h>
#include <algorithm> 
#include <vector> 

using namespace std;
vector<int> a[100001],c;

int n,m,x0,viz[100001];
vector<int>::iterator it;


void read()
{int x,y;
scanf("%d %d %d",&n,&m,&x0);
for(int i=1;i<=m;i++)
{scanf("%d %d",&x,&y);
a[x].push_back(y);}
}

void bf()
{int pi,ps,x;
pi=ps=1;
viz[x0]=1;
c.push_back(x0);
while(pi<=ps)
{x=c.back();
for(it=a[x].begin();it!=a[x].end();it++)
	if(!viz[*it])
	{viz[*it]=viz[x]+1;
	c.push_back(*it);
	ps++;}
pi++;}

for(int i=1;i<=n;i++)
	printf("%d ",--viz[i]);

}


int main()
{freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
read();
bf();


return 0;}