Pagini recente » Cod sursa (job #437761) | Cod sursa (job #1218653) | Cod sursa (job #1691024) | Cod sursa (job #1305172) | Cod sursa (job #2889310)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
const int N=1e5;
int m,n;
vector <int> graf[N+1];
vector <int> viz,dist,coada;
void BFS(int start)
{
int i,k,st=1,dr=1;
viz[start]=1;
coada[st]=start;
while(st<=dr)
{
k=coada[st];
for(auto i:graf[k])
if(viz[i]==0)
{
viz[i]=1;
dr++;
coada[dr]=i;
dist[i]=dist[k]+1;
}
st++;
}
for(i=1; i<=n; i++)
if(dist[i]==0 && i!=start)
g<<-1<<" ";
else if(i==start)
g<<0<<" ";
else g<<dist[i]<<" ";
}
int main()
{
int x,y,start;
f>>n>>m>>start;
viz.resize(N+1);
coada.resize(N+1);
dist.resize(N+1);
for(int i=1; i<=m; i++)
{
f>>x>>y;
graf[x].push_back(y);
}
BFS(start);
f.close();
g.close();
return 0;
}