Pagini recente » Cod sursa (job #3281502) | Cod sursa (job #1857758) | Cod sursa (job #131564) | Cod sursa (job #1826139) | Cod sursa (job #731583)
Cod sursa(job #731583)
#include <cstdio>
#include <vector>
#define MAX 100001
using namespace std;
vector<int>v[MAX];
bool viz[MAX];
int n,m,d[MAX],c[MAX],k;
void bfs(int s){
int i=1,x,y;
c[k=1]=s;
viz[s]=1;
while(i<=k){
x=c[i];
for(int i=0;i<v[x].size();i++){
y=v[x][i];
if(!viz[y]){
viz[y]=1;
c[++k]=y;
d[y]=d[x]+1; } }
i++; }
}
int main(){
int x,y,s;
freopen("bfs.in","r",stdin);
freopen("bfs.out","w",stdout);
scanf("%d %d %d",&n,&m,&s);
for(int i=1;i<=m;i++){
scanf("%d %d",&x,&y);
v[x].push_back(y);}
bfs(s);
for(int i=1;i<=n;i++)
if(d[i]>0||i==s)printf("%d ",d[i]);else printf("-1 ");
}