Cod sursa(job #2774447)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 11 septembrie 2021 17:36:45
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.51 kb
#include<cstdio>
#include<vector>
using namespace std;
#define N 100001
vector<int> a[N];
int s[N],c[N],n,m,l=1,o,i,j,k;
int main()
{
	freopen("bfs.in","r",stdin),freopen("bfs.out","w",stdout),scanf("%d%d%d",&n,&m,&o);
	for(i=1;i<=n;++i)
        c[i]=-1;
	while(m--)
		scanf("%d%d",&i,&j),a[i].push_back(j);
	for(c[o]=0,s[l]=o,i=1;i<=l;++i)
		for(k=a[s[i]].size(),j=0;j<k;++j)
			if(c[a[s[i]][j]]==-1)
				s[++l]=a[s[i]][j],c[s[l]]=c[s[i]]+1;
	for(i=1;i<=n;++i)
		printf("%d ",c[i]);
    return 0;
}