Cod sursa(job #1784150)

Utilizator zdavid112zIon David-Gabriel zdavid112z Data 19 octombrie 2016 20:17:48
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <cstdio>
#include <vector>

using namespace std;

struct Nod
{
    vector<int> v;
    int d;
} v[100000];

int st[100000];

int main()
{
    int i, n, m, s, a, b, lst = 1, r = 0;
    freopen("bfs.in", "r", stdin);
    freopen("bfs.out", "w", stdout);
    scanf("%d%d%d", &n, &m, &s);
    s--;
    for(i = 0; i < n; i++)
        v[i].d = -1;
    for(i = 0; i < m; i++)
    {
        scanf("%d%d", &a, &b);
        v[a - 1].v.push_back(b - 1);
    }
    st[0] = s;
    v[s].d = 0;
    while(r < lst)
    {
        const Nod& c  = v[st[r]];
        for(i = 0; i < c.v.size(); i++)
        {
            if(v[c.v[i]].d == -1)
            {
                st[lst] = c.v[i];
                v[c.v[i]].d = c.d + 1;
                lst++;
            }
        }
        r++;
    }
    for(i = 0; i < n; i++)
        printf("%d ", v[i].d);
    return 0;
}