Pagini recente » Borderou de evaluare (job #3207353) | Cod sursa (job #350758) | Rezultatele filtrării | Borderou de evaluare (job #2790195) | Cod sursa (job #1808375)
#include <bits/stdc++.h>
using namespace std;
ifstream f ("bfs.in");
ofstream g ("bfs.out");
vector <int> L[100003];
int n,m,x,y,z,nr,v[100003],T[100003],a[100003],Lg[100003],p,u,q[100003],nod;
bool sel[100003];
void load ()
{
f>>n>>m>>z;
for(int i=1;i<=m;i++)
f>>x>>y,v[x]++,v[y]++,L[x].push_back(y);
for (int i=1;i<=n;i++) Lg[i]=-1,Lg[z]=0;
}
void bfs (int x)
{
sel[x]=true;T[x]=Lg[x]=0,p=u=1,q[p]=x;
while (p<=u)
{nr=0;
nod=q[p];
for (int i=0;i<L[nod].size();i++)
if (!sel[L[nod][i]])
q[++u]=L[nod][i],sel[L[nod][i]]=true,nr++,Lg[L[nod][i]]=Lg[nod]+1,T[L[nod][i]]=nod;
p++;
}
}
int main()
{
load();
bfs(z);
for (int i=1;i<=n;i++) g<<Lg[i]<<' ';
return 0;
}