Pagini recente » Cod sursa (job #2330321) | Cod sursa (job #1012965) | Cod sursa (job #1464105) | Cod sursa (job #614010) | Cod sursa (job #2707878)
#include <bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s;
vector<int> lista[100005];
int dist[100005];
bool viz[100005];
void citire()
{
fin>>n>>m>>s;
int x,y;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
lista[x].push_back(y);
}
}
void bfs(int start)
{
queue<int> q;
q.push(start);
viz[start]=1;
while(!q.empty())
{
int nod=q.front();
q.pop();
for(auto x:lista[nod])
{
if(!viz[x])
{
viz[x]=1;
q.push(x);
dist[x]=dist[nod]+1;
}
}
}
}
void afisare()
{
for(int i=1;i<=n;i++)
{
if(dist[i]==0 && i!=s)
fout<<-1<<" ";
else fout<<dist[i]<<" ";
}
}
int main()
{
citire();
bfs(s);
afisare();
return 0;
}