Cod sursa(job #1096008)

Utilizator PlatonPlaton Vlad Platon Data 1 februarie 2014 13:48:28
Problema BFS - Parcurgere in latime Scor 20
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <stdio.h>
#include <vector>
#include <queue>

#define print(a) printf("%d ", a)
#define scan(a) scanf("%d", &a)

#define maxn 100000

using std::vector;
using std::queue;

bool viz[maxn];
int n, m, s, d[maxn];
vector<int> G[maxn];

void citire()
{
    freopen("bfs.in", "r", stdin);

    int a,b;
    scan(n); scan(m); scan(s);
    for(int i=0; i<m; i++)
    {
        scan(a); scan(b);
        G[a].push_back(b);
        d[i] = -1;
    }
}

void afisare()
{
    freopen("bfs.out", "w", stdout);

    for(int i=1;i<=n;i++)
    {
        print(d[i]);
    }
}

void bfs(int nod, int w)
{
    viz[nod]=1;
    queue<int> q;
    d[nod] = w;

    for(int i=0;i<G[nod].size();i++)
    {
        q.push(G[nod][i]);
    }

    while(!q.empty())
    {
        if(!viz[q.front()]) bfs(q.front(), w+1);
        q.pop();
    }
}

int main()
{
    citire();

    bfs(s, 0);

    afisare();
}