Cod sursa(job #1911004)

Utilizator Alexandru07Tomescu Ilie Alexandru Alexandru07 Data 7 martie 2017 19:07:32
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int n,m,viz[100001],c[100001],nr[100001],s;

vector <int> G[100001];

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

void bfs (int k)
{
    int i,p,u,y,x;
    p=u=1;
    viz[k]=1;
    c[1]=k;
    nr[k]=0;
    while(p<=u)
    {
        y=c[p];
        for(i=0;i<G[y].size(); i++)
        {
            x=G[y][i];
            if(viz[x]==0)
            {
                u++;
                c[u]=x;
                viz[x]=1;
                nr[x]=nr[y]+1;
            }
        }
        p++;
    }
}

int main()
{
    int i,x,y;
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        G[x].push_back(y);
    }
    bfs(s);
    for(i=1;i<=n;i++)
        if(viz[i]==0)
        g<<"-1 ";
    else
        g<<nr[i]<<" ";
        g<<"\n";
    return 0;
}