Pagini recente » Cod sursa (job #317830) | Cod sursa (job #1962183) | Cod sursa (job #2168353) | Cod sursa (job #1381437) | Cod sursa (job #2544039)
#include <fstream>
#include <vector>
#define dim 100010
using namespace std;
vector<int> a[dim];
int f[dim];
int d[dim];
int c[dim];
int i,n,m,p,u,s,x,y;
int main() {
ifstream fin("bfs.in");
ofstream fout("bfs.out");
fin>>n>>m>>s;
for (i=1;i<=m;i++) {
fin>>x>>y;
a[x].push_back(y);
}
c[p=u=1]=s;
f[s]=1;
while (p<=u) {
int nod=c[p];
for (i=0;i<a[nod].size();i++) {
int vecin=a[nod][i];
if (f[vecin]==0) {
f[vecin]=1;
c[++u]=vecin;
d[vecin]=d[nod]+1;
}
}
p++;
}
for (i=1;i<=n;i++) {
if (d[i]!=0) fout<<d[i]<<" ";
else {
if (i==s) fout<<0<<" ";
else fout<<-1<<" ";
}
}
return 0;
}