Cod sursa(job #1088844)

Utilizator cremarencodianaCremarenco Diana cremarencodiana Data 20 ianuarie 2014 21:26:15
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <cstdio>
# include <cstring>
# include <vector>
using namespace std;

vector <int> v[100010];
bool ok[100010];
int n,i,j,k,m,x,y,nr=0,s,niv[100010],p,u,q[100010];

int main()
{
    freopen ("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d %d %d\n",&n,&m,&s);
    for (i=1; i<=m; i++)
    {
        scanf("%d %d\n",&x,&y);
        v[x].push_back(y);
    }
    memset(niv,-1,sizeof(niv));
    niv[s]=0;
    nr=0;
    p=u=1;
    q[1]=s; ok[s]=true;
    while (p<=u)
    {
        int poz=q[p];
        for (i=0; i<v[q[p]].size(); i++)
            if (ok[v[poz][i]]==false)
            {
                u++;
                q[u]=v[q[p]][i];
                niv[v[q[p]][i]]=niv[q[p]]+1;
                ok[v[poz][i]]=true;
            }
        p++;
    }
    for (i=1; i<=n; i++)
        printf("%d ",niv[i]);
    printf("\n");
    return 0;
}