Cod sursa(job #2189591)

Utilizator RobertAndruscaAndrusca Robert RobertAndrusca Data 28 martie 2018 18:04:16
Problema BFS - Parcurgere in latime Scor 30
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <bits/stdc++.h>
#define oo 10000000
using namespace std;
int n, m, rad, dis[100020], viz[100020];
vector <int> L[100020];
void Citire()
{
    int x, y;
    ifstream in("bfs.in");
    in >> n >> m >> rad;
    for(int i = 1; i <= m; i++)
    {
        in >> x >> y;
        L[x].push_back(y);
    }
    in.close();
}

void Bfs_Dij()
{
    int i, j, pas;
    for(i = 0; i <= n; i++)
        dis[i] = oo;
    dis[rad] = 0;
    for(pas = 1; pas < n; pas++)
    {
        j = 0;
        for(i = 1; i <= n; i++)
            if(dis[j] > dis[i] && !viz[i])j = i;
        viz[j] = 1;
        if(j == 0)return;
        for(auto i : L[j])
            if(dis[i] > dis[j] + 1)dis[i] = dis[j] + 1;
    }
}
int main()
{
    Citire();
    Bfs_Dij();
    ofstream out("bfs.out");
    for(int i = 1; i <= n; i++)
        if(viz[i])out << dis[i] << " ";
        else out << "-1 ";
    return 0;
}