Cod sursa(job #2355473)

Utilizator capmareAlexCapmare Alex capmareAlex Data 26 februarie 2019 09:16:31
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.8 kb
#include <bits/stdc++.h>

#define NMAX 100001
using namespace std;

vector <int > v[NMAX];
int cost[NMAX];
queue<int >coada;
bool fr[NMAX];

int N,M,S;
int main()
{
    ifstream fin("bfs.in");
    ofstream fout("bfs.out");
    fin>>N>>M>>S;
    for(int i=1;i<=M;++i)
    {
        int x,y;
        fin>>x>>y;
        v[x].push_back(y);
    }
    coada.push(S);
    fr[S]=1;
    while(!coada.empty())
    {
        int r= coada.front();
        coada.pop();
        for(auto x: v[r])
        {
            if(!fr[x])
            {
                fr[x]=1;
                cost[x]=cost[r]+1;
                coada.push(x);
            }
        }
    }
    for(int i=1;i<=N;++i,fout<<" ")
    {
        if(!fr[i])fout<<-1;
        else fout<<cost[i];
    }

    return 0;
}