Pagini recente » Cod sursa (job #127544) | Cod sursa (job #731609) | Cod sursa (job #2016977) | Cod sursa (job #2034720) | Cod sursa (job #2706883)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector<int> G[100001];
int N,M,x,y,S;
int Coada[100001],st=1,dr;
int viz[100001];
void BFS()
{
while(st<=dr)
{
int nod_curent=Coada[st];
st++;
for(vector<int>::iterator nod=G[nod_curent].begin(); nod!=G[nod_curent].end(); ++nod)
if(!viz[*nod] && *nod!=S)
{
viz[*nod]=viz[nod_curent]+1;
Coada[++dr]=*nod;
}
}
}
int main()
{
f>>N>>M>>S;
for(int i=1; i<=M; i++)
{
f>>x>>y;
G[x].push_back(y);
}
Coada[++dr]=S;
BFS();
for(int i=1; i<=N; i++)
{
if(i==S)
g<<0<<" ";
else
{
if(!viz[i])
g<<-1<<" ";
else g<<viz[i]<<" ";
}
}
return 0;
}