Cod sursa(job #2427788)

Utilizator georgeoctavianGeorge Octavian Grumazescu georgeoctavian Data 2 iunie 2019 11:33:14
Problema BFS - Parcurgere in latime Scor 20
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.75 kb
#include <bits/stdc++.h>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,s,nr[100010],x,y,use[100010];
vector <int> v[100010];
priority_queue <int> pq;
int main()
{
    ios_base::sync_with_stdio(false);
    fin>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    pq.push(s);
    use[s]=1;
    while(!pq.empty())
    {
        x=pq.top();
        pq.pop();
        for(auto it : v[x])
            if(!use[it])
            {
                nr[it]=nr[x]+1;
                use[it]=1;
                pq.push(it);
            }
    }
    for(int i=1;i<=n;i++)
        if(use[i])
            fout<<nr[i]<<' ';
        else fout<<-1<<' ';
    return 0;
}