Cod sursa(job #2302158)
Utilizator | Data | 13 decembrie 2018 21:18:06 | |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include<cstdio>
#include<vector>
using namespace std;
#define N 100001
vector<int> a[N];
int g[N],s[N],c[N]={-1},n,m,l=1,o,i,x,y,j;
int main()
{
freopen("bfs.in","r",stdin),freopen("bfs.out","w",stdout),scanf("%d%d%d",&n,&m,&o);
while(m--)
scanf("%d%d",&x,&y),a[x].push_back(y);
for(i=1;i<=n;i++)
g[i]=a[i].size();
for(c[o]=0,s[l]=o,i=1;i<=l;i++)
for(j=0;j<g[s[i]];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]);
}