Pagini recente » Cod sursa (job #1451572) | Cod sursa (job #1336422) | Cod sursa (job #1178979) | Cod sursa (job #2024603) | Cod sursa (job #1808403)
#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector<int> v[100010];
queue<int> q;
int n,m,i,s,x,y,rez[100010];
int main()
{
f>>n>>m>>s;
for(i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
}
q.push(s);rez[s]=1;
while(q.size())
{
x=q.front();
q.pop();y=rez[x]+1;
for(auto it:v[x])
if(rez[it]==0)
{
rez[it]=y;
q.push(it);
}
}
for(i=1;i<=n;i++)
g<<rez[i]-1<<' ';
return 0;
}