Cod sursa(job #2367822)
Utilizator | Andreea Amza AndreeaAmza | Data | 5 martie 2019 12:22:10 |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.66 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream f ("bfs.in");
ofstream g ("bfs.out");
long mat[10001][10001],a,b,C[101],p,u,viz[101],n,m,X,i,v,s[101];
int main()
{
f>>n>>m>>X;
for(i=1;i<=m;i++)
{
f>>a>>b;
mat[a][b]=1;
}
viz[X]=1;
C[1]=X;
p=1;u=1;
while(p<=u)
{
v=C[p];
for(i=1;i<=n;i++)
if(mat[v][i]==1 && viz[i]==0)
{
u++;
C[u]=i;
viz[i]=1;
s[i]=s[v]+1;
}
p++;
}
for(i=1;i<=n;i++)
if(viz[i]!=0) g<<s[i]<<" ";
else g<<-1<<" ";
return 0;
}