Cod sursa(job #1566461)

Utilizator ipus1Stefan Enescu ipus1 Data 12 ianuarie 2016 08:30:09
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include<cstdio>
#include<vector>
using namespace std;
vector<int> v[100001];
int c[100001],vc[100001];
int main ()
{freopen ("bfs.in","r",stdin);
freopen ("bfs.out","w",stdout);
int n,m,s,i,in,sf,x,y;
scanf("%d%d%d",&n,&m,&s);
for(i=1;i<=m;i++)
    {scanf("%d%d",&x,&y);
    v[x].push_back(y);
    }
in=sf=1;
c[1]=s;
while(in<=sf)
    {for(i=0;i<v[c[in]].size();i++)
        if(vc[v[c[in]][i]]==0&&v[c[in]][i]!=s)
            {sf++;
            c[sf]=v[c[in]][i];
            vc[v[c[in]][i]]=vc[c[in]]+1;
            }
    in++;
    }
for(i=1;i<=n;i++)
    if(vc[i]==0)
        vc[i]=-1;
vc[s]=0;
for(i=1;i<=n;i++)
    printf("%d ",vc[i]);
return 0;
}