Mai intai trebuie sa te autentifici.
Cod sursa(job #2356987)
Utilizator | Data | 27 februarie 2019 08:02:03 | |
---|---|---|---|
Problema | BFS - Parcurgere in latime | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.75 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> v[100005];
int c[100005],viz[100005],d[100005],n;
void BF(int x)
{
int p,u;
p=u=1;
c[u]=x;viz[x]=1;
d[x]=0;
while(p<=u)
{
x=c[p++];
for(auto i : v[x])
{
if(viz[i]==0)
{
viz[i]=1;
c[++u]=i;
d[i]=d[x]+1;
}
}
}
}
int main()
{
int x,y,m,S,i;
fin>>n>>m>>S;
for(i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back(y);
}
BF(S);
for(i=1;i<=n;i++,fout<<" ")
{
if(viz[i]==1)fout<<d[i];
else fout<<"-1";
}
return 0;
}