Pagini recente » Cod sursa (job #680518) | Istoria paginii runda/iconcurs18 | Cod sursa (job #859197) | Cod sursa (job #1870812) | Cod sursa (job #984563)
Cod sursa(job #984563)
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int N,M,S;
int C[100002],Use[100002],D[100002];
vector <int> G[100002];
void Read()
{
f>>N>>M>>S;
int i;
for(i=1;i<=M;i++)
{
int x,y;
f>>x>>y;
G[x].push_back(y);
}
}
void BFS()
{
int i;
C[1]=S;
int k=1;
for(i=1;i<=k;i++)
{
int nod=C[i];
for(unsigned int j=0;j<G[nod].size();j++)
if(!Use[G[nod][j]])
{
C[++k]=G[nod][j];
D[G[nod][j]]=D[nod]+1;
Use[C[k]]=1;
}
}
}
void Print()
{
int i;
for(i=1;i<=N;i++)
{
if(Use[i])
g<<D[i]<<" ";
else
g<<-1<<" ";
}
g<<"\n";
}
int main()
{
Read();
BFS();
Print();
return 0;
}