Cod sursa(job #2924595)

Utilizator DafinaTrufasTrufas Dafina DafinaTrufas Data 5 octombrie 2022 20:19:12
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.81 kb
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

int n, v[100001], c[100001], nrv[100001];
vector <int> l[100001];

ofstream g("bfs.out");

void bf (int s)
{
    int p = 1, u = 1, i;
    c[1] = s;
    for(i = 1; i <= n; i++) v[i] = -1;
    v[s] = 0;
    while (p <= u)
    {
        s = c[p];
        for (i = 0; i < nrv[s]; i++)
            if (v[l[s][i]] == -1)
            {
                c[++u] = l[s][i];
                v[l[s][i]] = v[s] + 1;
            }
        p++;
    }
    for(i = 1; i <= n; i++)
        g << v[i] << ' ';
}

int main()
{int m, s, i, x, y;
ifstream f("bfs.in");
f >> n >> m >> s;
for(i = 1; i <= m; i++)
{
    f >> x >> y;
    l[x].push_back(y);
}
for(i = 1; i <= n; i++)
    nrv[i] = l[i].size();
bf(s);
return 0;
}