Cod sursa(job #1703893)

Utilizator Tomi98Osvath Tamas Tomi98 Data 17 mai 2016 19:07:43
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.86 kb
#include <fstream>
#include <deque>
#include <vector>
#define dim 100001

using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

vector <int > v[dim];
deque <int > C;

bool viz[dim];
int dist[dim], n, m, s;

int main()
{
    fin >> n >> m >> s;
    for (int i = 1; i <= m; i++){
        int x, y;
        fin >> x >> y;
        v[x].push_back(y);
    }
    C.push_back(s);
    viz[s] = 1;
    while (!C.empty()){
        int p;
        p = C.front();
        C.pop_front();
        for (int i = 0; i < int(v[p].size()); i++)
            if (!viz[v[p][i]]){
                viz[v[p][i]] = 1;
                C.push_back(v[p][i]);
                dist[v[p][i]] = dist[p] + 1;
            }
    }
    for (int i = 1; i <= n; i++)
        if (viz[i] == 1) fout << dist[i] << " ";
            else fout << "-1 ";
    return 0;
}