Pagini recente » Cod sursa (job #3208339) | Cod sursa (job #3222442) | Cod sursa (job #2387115) | Cod sursa (job #1047298) | Cod sursa (job #2867683)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
const int O=100001;
vector<int> a[O];
int d[O];
int N,M,S;
int main()
{
cin>>N>>M>>S;
for(int i=0;i<M;i++)
{
int x,y;
cin>>x>>y;
a[x].push_back(y);
}
for(int i=1;i<=N;i++)
{
d[i]=-1;
}
queue<int> q;
q.push(S);
d[S]=0;
while(!q.empty())
{
int x=q.front();
q.pop();
for(auto y:a[x])
{
if(d[y]==-1)
{
q.push(y);
d[y]=1+d[x];
}
}
}
for(int i=1;i<=N;i++)
{
cout<<d[i]<<" ";
}
return 0;
}