Pagini recente » Cod sursa (job #1856880) | Cod sursa (job #683005) | Cod sursa (job #72221) | Cod sursa (job #944890) | Cod sursa (job #2460680)
#include <bits/stdc++.h>
#define pii pair <int,int>
#define INF 0x3f3f3f3f
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int m,n,drum[100005],s;
vector <int> v[100005];
queue <int> q;
void bfs()
{
while(!q.empty())
{
int nod=q.front();
q.pop();
for(auto it=v[nod].begin();it<v[nod].end();it++)
{
int nxt;
nxt=*it;
if(drum[nxt]>drum[nod]+1)
{
drum[nxt]=drum[nod]+1;
q.push(nxt);
}
}
}
}
int main()
{
fin>>n>>m>>s;
memset(drum,INF,sizeof(drum));
for(int i=1;i<=m;i++)
{
int x,y;
fin>>x>>y;
v[x].push_back(y);
}
drum[s]=0;
q.push(s);
bfs();
for(int i=1;i<=n;i++)
{
if(drum[i]==INF)
fout<<-1<<" ";
else
fout<<drum[i]<<" ";
}
return 0;
}