Cod sursa(job #1698808)

Utilizator mariusn01Marius Nicoli mariusn01 Data 5 mai 2016 14:12:23
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <fstream>
#include <vector>
#define DIM 100010
using namespace std;

vector<int> L[DIM];
int d[DIM], v[DIM], c[DIM];

int n, m, s, x, y, i, p, u, nod, vecin;

int main () {
    ifstream fin ("bfs.in");
    ofstream fout("bfs.out");
    fin>>n>>m>>s;
    for (i=1;i<=m;i++) {
        fin>>x>>y;
        L[x].push_back(y);
    }

    c[1] = s;
    v[s] = 1;
    p = 1;
    u = 1;
    d[s] = 1;
    while (p <= u) {
        nod = c[p];
        for (i=0;i<L[ nod ].size(); i++) {
            vecin = L[nod][i];
            if (v[vecin] == 0) {
                c[++u] = vecin;
                d[vecin] = 1 + d[nod];
                v[vecin] = 1;
            }
        }
        p++;
    }
    for (i=1;i<=n;i++)
        fout<<-1 + d[i]<<" ";

    return 0;
}