Pagini recente » Cod sursa (job #480311) | Cod sursa (job #1887182) | Istoria paginii runda/id/clasament | Cod sursa (job #2390194) | Cod sursa (job #1944515)
#include <fstream>
#include<vector>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
const int N=100000;
vector<int> a[N];
int main()
{
int n,m,x0,x,y,INF=-1,p,u,q[100001],d[100001];
in>>n>>m>>x0;
for(int i=0;i<m;i++){
in>>x>>y;
a[x].push_back(y);
}
for(int i=1;i<=n;i++)
{
d[i]=INF;
}
p=0;
u=-1;
q[++u]=x0;
d[x0]=0;
while(p<=u){
x=q[p++];
for(int i=0;i<a[x].size();i++){
y=a[x][i];
if(d[y]==INF){
q[++u]=y;
d[y]=1+d[x];
}
}
}
for(int i=1;i<=n;i++)
out<<d[i]<<" ";
return 0;
}