Cod sursa(job #1903351)

Utilizator victoreVictor Popa victore Data 5 martie 2017 10:36:14
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include<cstdio>
#include<vector>
using namespace std;
const int nm=100005;
vector <int> a[nm];
int lng[nm],q[nm],viz[nm];
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int x,y,n,i,start,m,l,st,dr;
    scanf("%d%d%d",&n,&m,&start);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        a[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        lng[i]=a[i].size();
    for(i=1;i<=n;i++)
        viz[i]=-1;
    viz[start]=0;
    st=dr=1;
    q[st]=start;
    while(st<=dr)
    {
        for(i=0;i<lng[q[st]];i++)
        {
            if(viz[a[q[st]][i]]==-1)
            {
                q[++dr]=a[q[st]][i];
                viz[q[dr]]=viz[q[st]]+1;
            }
        }
        st++;
    }
    for(i=1;i<=n;i++)
        printf("%d ",viz[i]);
    printf("\n");
}