Cod sursa(job #2491098)

Utilizator catalinpuricoicatalinpuricoi catalinpuricoi Data 11 noiembrie 2019 20:07:32
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.93 kb
#include <bits/stdc++.h>
#define NMAX 100010
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
deque <pair <int,int> > coada;
vector <int> l_a[NMAX];
int sfarsit[NMAX], n, m, s, nod, pasi, i, x, y;
bool viz[NMAX];
int main()
{
    f>>n>>m>>s;
    for(i=1; i<=m; i++)
    {
        f>>x>>y;
        l_a[x].push_back(y);
    }
    coada.push_back({s,0});
    viz[s]=1;
    while(coada.size()!=0)
    {
        nod=coada.front().first;
        pasi=coada.front().second;
        coada.pop_front();
        sfarsit[nod]=pasi;
        for(i=0; i<l_a[nod].size(); i++)
        {
            if(viz[l_a[nod][i]]==0)
            {
                viz[l_a[nod][i]]=1;
                coada.push_back({l_a[nod][i],pasi+1});
            }
        }
    }
    for(i=1; i<=n; i++)
    {
        if(sfarsit[i]==0 && i!=s)
            g<<-1<<' ';
        else
        g<<sfarsit[i]<<' ';
    }
    return 0;
}