Cod sursa(job #3350889)

Utilizator EricMartinmartin petru eric EricMartin Data 14 aprilie 2026 17:28:48
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1 kb

#include <fstream>
#include <vector>
using namespace std;

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

vector<int> g[100001];
int viz[100001];
int dist[100001];

void bfs (int x)
{
    int coada[100001];
    int dr = 1,st = 1;
    coada[1] = x;
    viz[x] = 1;
    while (st <= dr)
    {
        int nod = coada[st];
        for (int i = 0; i < g[nod].size(); i++)
        {
            if (viz[g[nod][i]] == 0)
            {
                dist[g[nod][i]] = dist[nod] + 1;
                viz[g[nod][i]] = 1;
                dr++;
                coada[dr] = g[nod][i];
            }
        }
        st++;
    }
}


int main()
{
    int n,m,s;
    cin >>n>>m>>s;
    for (int i = 1; i <= m; i++)
    {
        int x,y;
        cin >>x>>y;
        g[x].push_back(y);
    }
    bfs(s);
    for (int i = 1; i <= n; i++)
    {
        if (dist[i] == 0 && i != s)
        {
            dist[i] = -1;
        }
        cout <<dist[i]<<" ";
    }
    return 0;
}