Cod sursa(job #3257680)

Utilizator Gabriel_DaescuDaescu Gabriel Florin Gabriel_Daescu Data 18 noiembrie 2024 21:29:28
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.83 kb
#include <fstream>
#include <vector>
#include <queue>
#define NMAX 100002
using namespace std;
ifstream  fin("bfs.in");
ofstream fout("bfs.out");
int N,M,S,viz[NMAX];
vector<int>v[NMAX],sol(NMAX,-1);
queue <int>q;

void citire()
{
    int X,Y;
    fin>>N>>M>>S;

    for(int i=1; i<=M; i++)
    {
        fin>>X>>Y;
        v[X].push_back(Y);
    }
}

int main()
{
    citire();

    sol[S]=0;
    q.push(S);

    while(!q.empty())
    {
        int nod=q.front();
        q.pop();

        for(int i=0; i<v[nod].size(); i++)
        {
            if(sol[v[nod][i]]==-1)
            {
                sol[v[nod][i]]=1+sol[nod];
                q.push(v[nod][i]);
            }
        }
    }

    for(int i=1; i<=N; i++)
    {
        fout<< sol[i] << " ";
    }
    fout<< "\n";

    return 0;
}