Cod sursa(job #2061121)

Utilizator stefdascalescuStefan Dascalescu stefdascalescu Data 8 noiembrie 2017 22:22:52
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include<bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s;
int dmin[100002];
bool viz[100002];
vector<int>v[100002];
deque<int>d;
int main()
{
    f>>n>>m>>s;
    for(int i=1;i<=m;++i)
    {
        int a,b;
        f>>a>>b;
        v[a].push_back(b);
    }
    viz[s]=1;
    d.push_back(s);
    while(!d.empty())
    {
        for(int i=0;i<v[d.front()].size();++i)
            if(!viz[v[d.front()][i]])
            {
                viz[v[d.front()][i]]=1;
                dmin[v[d.front()][i]]=dmin[d.front()]+1;
                d.push_back(v[d.front()][i]);
            }
        d.pop_front();
    }
    for(int i=1;i<=n;++i)
        if(viz[i])
            g<<dmin[i]<<" ";
        else
            g<<-1<<" ";
    return 0;
}