Cod sursa(job #3371367)

Utilizator ursus161Stefan Ghetu ursus161 Data 29 octombrie 2026 21:53:16
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.8 kb
#include <bits/stdc++.h>

std::vector<int> vizitat(200, -1);
std::vector<std::vector<int>> graf;

void bfs(int n)
{

    std::queue<int> q;
    int d = 0;
    vizitat[n] = 1;
    q.push(n);

    while (!q.empty())
    {

        int nod = q.front();
        q.pop();

        for (int i : graf[nod])
        {

            if (vizitat[i] == -1)
            {
                vizitat[i] = vizitat[nod] + 1;
                q.push(i);
            }
        }
    }
}

int main()
{

    std::ifstream fin("bfs.in");
    std::ofstream fout("bfs.out");

    int n, m, k;
    fin >> n >> m >> k;
    graf.resize(n + 1);

    for (int i = 0; i < m; i++)
    {
        int x, y;
        fin >> x >> y;
        graf[x].push_back(y);
    }

    bfs(k);
    for(int i = 1; i <= n; i++)
    {
        fout << vizitat[i] << " ";
    }
}