Cod sursa(job #2425141)

Utilizator bazycristi21Bazavan Cristian bazycristi21 Data 24 mai 2019 13:31:27
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.62 kb
#include <fstream>
#include <vector>
#include <set>
#include <queue>


using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
int main()
{
    int n,m,x;
    in>>n>>m>>x;
    vector<vector<int>>G(n+1);
    vector<int> viz(n+1,-1);
    viz[x]=0;
    for(int i=1;i<=m;i++)
    {
        int a,b;
        in>>a>>b;
        G[a].push_back(b);
    }
    for(int i=1;i<=n;i++)
    {
        for(auto j:G[i])
        {
            if(viz[j]==-1)
            {
                viz[j]=viz[i]+1;
            }
        }
    }
    for(int i=1;i<=n;i++)
    {
        out<<viz[i]<<" ";
    }
}