Cod sursa(job #858242)

Utilizator aladinaladin aladinn aladin Data 18 ianuarie 2013 18:37:11
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <cstdio>
#include <vector>
#include <deque>
#define pb push_back
using namespace std;
vector <int> v[100009];
deque <int> coad;
int d[100009];

int main()
{
	
	int n,m,s,i,j;
	
	freopen("bfs.in","r",stdin);
	freopen("bfs.out","w",stdout);
	scanf("%d %d %d",&n,&m,&s);
	for (i=1;i<=m;++i)
	{
		int x,y;
		scanf("%d %d",&x,&y);
		v[x].pb(y);
	}
	
	coad.pb(s);m=1;d[s]=1;
	while (m)
		for (i=m,m=0;i>0;--i)
		{
		s=coad.front();coad.pop_front();
		
		for (vector<int>::iterator it=v[s].begin();it!=v[s].end();++it)
			if (!d[*it])
				d[*it]=d[s]+1,++m,coad.pb(*it);
			
				
		}
	
for (i=1;i<=n;++i)
printf("%d ",d[i]-1);
return 0;
}