Cod sursa(job #2133061)

Utilizator cristianursacheCristian Ursache cristianursache Data 16 februarie 2018 15:18:54
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <fstream>
#include <vector>

using namespace std;

ifstream in ("bfs.in");
ofstream out ("bfs.out");

const int N = 100001;

vector <int> a[N];

int n, m, s, d[N], q[N];

void citire ()
{
    int x, y;
    in >> n >> m >> s;
    for (int i = 1; i <= m; i++)
    {
        in >> x >> y;
        a[x].push_back (y);
    }
    in.close();
}

int main()
{
    int st, dr, x, y;
    citire ();
    for (int i = 1; i <= n; i++)
        d[i] = -1;
    st = 0;
    dr = -1;
    q[++dr] = s;
    d[s] = 0;
    while (st <= dr)
    {
        x = q[st++];
        for (int i = 0; i < a[x].size(); i++)
        {
            y = a[x][i];
            if (d[y] == -1)
            {
                q[++dr] = y;
                d[y] = 1 + d[x];
            }
        }
    }
    for (int i = 1; i <= n; i++)
        out << d[i] << " ";
    return 0;
}