Pagini recente » Cod sursa (job #2793717) | Cod sursa (job #1694584) | Cod sursa (job #2584986) | Cod sursa (job #555000) | Cod sursa (job #1268778)
#include<fstream>
#include<vector>
using namespace std;
int n, m2, xx, i, nod, fiu, m[100007], c[100007], x, y, p, u;
vector <int> L[100007];
ifstream in("bfs.in");
ofstream out("bfs.out");
int main(){
in>>n>>m2>>xx;
for(i=1; i<=m2; i++){
in>>x>>y;
L[x].push_back(y);
}
m[xx]=1;
p=u=1;
c[1]=xx;
while(p<=u){
nod=c[p];
for(i=0; i<L[nod].size(); i++){
fiu=L[nod][i];
if(m[fiu]==0){
c[++u]=fiu;
m[fiu]=m[nod]+1;
}
}
p++;
}
for(i=1; i<=n; i++)
out<<m[i]-1<<" ";
return 0;
}