Cod sursa(job #2690937)

Utilizator BlaugranasEnal Gemaledin Blaugranas Data 26 decembrie 2020 14:42:57
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.51 kb
#include<cstdio>
#include<vector>
#define P push_back
using namespace std;
const int N=100001;
int s[N],c[N],n,m,l=1,o,i,j,k;
vector<int> a[N];
int main()
{
	freopen("bfs.in","r",stdin),freopen("bfs.out","w",stdout),scanf("%d%d%d",&n,&m,&o);
	while(m--)
		scanf("%d%d",&i,&j),a[i].P(j);
    for(i=1;i<=n;i++)
        c[i]=-1;
	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]);
}