Pagini recente » Borderou de evaluare (job #225542) | Cod sursa (job #2267339)
#include <bits/stdc++.h>
#define FISIERE 1
using namespace std;
#if FISIERE
string file_name="bfs";
ifstream f(file_name+".in");
ofstream g(file_name+".out");
#endif
const int N = 100010;
int n,m,nod,i,j,d[N];
vector<int> v[N];
queue<int> q;
int main()
{
f>>n>>m>>nod;
for(; m; m--)
{
f>>i>>j;
v[i].push_back(j);
}
q.push(nod);d[nod]=1;
while(q.size())
{
nod=q.front();
q.pop();
for(auto vec:v[nod])
if(!d[vec])
{
q.push(vec);d[vec]=d[nod]+1;
}
}
for(int i=1;i<=n;i++)
g<<d[i]-1<<' ';
return 0;
}