Cod sursa(job #2969347)

Utilizator LucaT2Tasadan Luca LucaT2 Data 22 ianuarie 2023 21:31:39
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.88 kb
#include <bits/stdc++.h>

using namespace std;

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

int n,m,r;
vector<int>v[100005];

void citire()
{

    fin>>n>>m>>r;
    int x,y;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
}
int viz[100005],d[100005];
void bfs(int k)
{
    queue<int>q;
    viz[k]=1;
    q.push(k);
    d[k]=0;
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for(auto i:v[x])
            if(!viz[i])
        {
            viz[i]=1;
            d[i]=d[x]+1;
            q.push(i);
        }
    }
}

void afis()
{
    for(int i=1;i<=n;i++)
    {
        if(i==r)
            fout<<0<<" ";
        else if(d[i]==0)
            fout<<-1<<" ";
        else fout<<d[i]<<" ";
    }
}

int main()
{
    citire();
    bfs(r);
    afis();
    return 0;
}