Cod sursa(job #2195554)

Utilizator vlad_schillerSchiller Vlad Radu vlad_schiller Data 16 aprilie 2018 18:59:06
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#define maxu 100005
using namespace std;
int n,m,s,pasi[maxu];
queue < int > q;
vector < int > g[maxu];
void citire()
{
    int x, y;
    ifstream f("bfs.in");
    f>>n>>m>>s;
    for(int i=0; i<m; i++)
    {
        f>>x>>y;
        g[x].push_back(y);
    }
}

void bfs()
{
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        for (auto& v : g[x])
        {
            if(!pasi[v])
            {
                q.push(v);
                pasi[v]=pasi[x]+1;
            }
        }
    }
}

int main()
{
    ofstream g("bfs.out");
    citire();
    q.push(s);
    pasi[s]=1;
    bfs();
    for(int i=1;i<=n;i++)
        g<<pasi[i]-1<<' ';
    return 0;
}