Cod sursa(job #2045974)
Utilizator | Data | 23 octombrie 2017 10:37:27 | |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.63 kb |
#include <iostream>
#define nm 100001
using namespace std;
int c[nm], viz[nm], n,m;
vector <int> G[nm];
int main()
{
int x,y,i,p,u,s;
cin>>n>>n>>s;
for(i=1;i<=m;i++)
{ cin>>x>>y;
if(x!=y) G[x].push_back(y);
}
c[1]=s;
viz[s]=1;
p=u=1;
while(p<=u)
{
z=c[p]; p++;
for(i=0;i<G[z].size;i++)
{
y=G[z][i];
if(viz[y]==0)
{
viz[y]=viz[z]+1;
u++;
c[u]=y;
}
}
}
for(i=1;i<=m;i++)
fout<<viz[i]-1<<' ';
return 0;
}