Cod sursa(job #1823257)

Utilizator raluvladRaluca Vlad raluvlad Data 6 decembrie 2016 09:29:08
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>
#include <vector>

using namespace std;
vector <int> g[100005];
int v[100005],c[100005],n,m,s;

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

void read()
{
    int x,y;
    in>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        in>>x>>y;
        g[x].push_back(y);
    }
}

void bfs()
{
    int k;
    v[s]=1;
    c[1]=s; k=1;

    for(int i=1;i<=k;i++)
    {
        int nod=c[i];
        for(unsigned int j=0; j<g[nod].size();j++)
        {
            int vecin=g[nod][j];
            if(v[vecin]==0)
            {
                v[vecin]=v[nod]+1;
                c[++k]=vecin;
            }
        }
    }
}

void print()
{
    for(int i=1;i<=n;i++)
        out<<v[i]-1<<' ';
    out<<'\n';
}

int main()
{
    read();
    bfs();
    print();

    return 0;
}