Cod sursa(job #920446)

Utilizator cbanu96Banu Cristian cbanu96 Data 20 martie 2013 14:08:14
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include <cstdio>
#include <vector>

#define NMAX 100001
#define FILEIN "bfs.in"
#define FILEOUT "bfs.out"

using namespace std;

vector<int> A[NMAX];
int Q[NMAX];
int sol[NMAX];
int viz[NMAX];
int n,m,i,j,x,y,s,now,next;

int main()
{
    freopen(FILEIN,"r",stdin);
    freopen(FILEOUT,"w",stdout);
    scanf("%d %d %d", &n, &m, &s);
    for ( i = 1; i <= m; i++ )
    {
        scanf("%d %d", &x, &y);
        A[x].push_back(y);
    }
    for ( i = 1; i <= n; i++)
        sol[i] = -1;
    int p, u;
    p = u = 1;
    Q[p] = s;
    viz[s] = 1;
    sol[s] = 0;
    while ( p <= u )
    {
        now = Q[p];
        p++;
        for ( i = 0; i < A[now].size(); i++ )
        {
            next = A[now][i];
            if(!viz[next])
            {
                u++;
                Q[u] = next;
                viz[next] = 1;
                sol[next] = sol[now]+1;
            }
        }
    }
    for ( i = 1; i <= n; i++)
        printf("%d ", sol[i]);
    printf("\n");
    return 0;
}