Pagini recente » Cod sursa (job #3148415) | Cod sursa (job #2864165) | Cod sursa (job #522111) | Cod sursa (job #489619) | Cod sursa (job #731577)
Cod sursa(job #731577)
#include <cstdio>
#include <vector>
#include <list>
#define MAX 100001
using namespace std;
vector<int>v[MAX];
list<int>c;
bool viz[MAX];
int n,m,d[MAX];
void bfs(int s){
int x,y;
c.push_back(s);
viz[s]=1;
while(c.size()>0){
x=c.front();
for(int i=0;i<v[x].size();i++){
y=v[x][i];
if(!viz[y]){
viz[y]=1;
c.push_back(y);
d[y]=d[x]+1; } }
c.pop_front(); }
}
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 ");
}