Cod sursa(job #2072954)

Utilizator alex2209alexPavel Alexandru alex2209alex Data 22 noiembrie 2017 15:14:55
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s,a,b,d[100001];
vector<int>adj[100001];
void bfs(int nod,int dist)
{
    d[nod]=dist;
    for(int i=0; i<adj[nod].size(); i++)
    {
        if(dist+1<d[adj[nod][i]] or d[adj[nod][i]]==-1)
        {
            bfs(adj[nod][i],dist+1);
        }
    }
}
int main()
{
    f>>n>>m>>s;
    for(int i=1; i<=n; i++)
    {
        d[i]=-1;
    }
    for(int i=1; i<=m; i++)
    {
        f>>a>>b;
        adj[a].push_back(b);
    }
    bfs(s,0);
    for(int i=1; i<=n; i++)
    {
        g<<d[i]<<" ";
    }
    return 0;
}