Cod sursa(job #2032901)

Utilizator PaulTPaul Tirlisan PaulT Data 5 octombrie 2017 20:51:03
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.11 kb
#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

using VI = vector<int>;
using VB = vector<bool>;

const int Inf = 0x3f3f3f3f;
int n, m, s;
vector<VI> G;
VB v;
VI d;

void Read();
void Bfs();
void Write();

int main()
{
    Read();
    Bfs();
    Write();
}

void Write()
{
    for (int i = 1; i <= n; i++)
        if (d[i] == Inf)
            fout << "-1 ";
        else
            fout << d[i] << ' ';
    fout.close();
}

void Bfs()
{
    queue<int> Q;
    Q.push(s);
    v[s] = true;
    d[s] = 0;

    while (!Q.empty())
    {
        s = Q.front();
        Q.pop();
        for (const int& x : G[s])
        {
            if (v[x]) continue;
            v[x] = true;
            Q.push(x);
            d[x] = d[s] + 1;
        }
    }
}

void Read()
{
    fin >> n >> m >> s;
    G = vector<VI>(n + 1);
    v = VB(n + 1);
    d = VI(n + 1, Inf);

    int x, y;
    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        G[x].push_back(y);
    }
    fin.close();
}