Cod sursa(job #2866891)

Utilizator FastmateiMatei Mocanu Fastmatei Data 10 martie 2022 08:19:48
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.79 kb
#include <bits/stdc++.h>
#define oo 5555555

using namespace std;

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

queue<int>q;
vector<int>v[100005];
int n,m,s;
int d[100005];
int viz[100005];

void MVP(int x)
{
    for(int i=1;i<=n;i++)
        d[i]=oo;
    d[x]=0;
    viz[x]=1;
    q.push(x);
    while(!q.empty())
    {
        int k=q.front();
        q.pop();
        for(auto w:v[k])
            if(d[w]>d[k]+1)
            {
                d[w]=d[k]+1;
                q.push(w);
            }
    }
}

int main()
{
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
    }
    MVP(s);
    for(int i=1;i<=n;i++)
        if(d[i]==oo) fout<<"-1 ";
        else fout<<d[i]<<" ";
    return 0;
}