Cod sursa(job #1785553)

Utilizator MarcSpataruMarc Spataru MarcSpataru Data 21 octombrie 2016 15:54:52
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1 kb
#include<cstdio>
#include<vector>
using namespace std;
int X,lungmax,ic,sf,coada[100001],viz[100001],lung[100001];
vector <int> vec[100001];
void BFS()
{
    ic=sf=1;coada[1]=X;lungmax=0;viz[X]=1;
    int i;
    while(ic<=sf)
    {
        for(i=0;i<vec[coada[ic]].size();i++)
        {
            if (viz[vec[coada[ic]][i]] == 0) {
                coada[++sf]=vec[coada[ic]][i];
                lung[coada[sf]]=1+lung[coada[ic]];
                if(lungmax<lung[coada[sf]])
                    lungmax=lung[coada[sf]];
                viz[vec[coada[ic]][i]] = 1;
            }
        }
        ic++;
    }
}
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int n,m,x,y,i;
    scanf("%d%d%d",&n,&m,&X);
    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        vec[x].push_back(y);
    }
    BFS();
    for(i=1;i<=n;i++)
        if(viz[i]==1)
            printf("%d ",lung[i]);
        else
            printf("-1 ");
    return 0;
}