Cod sursa(job #1801949)

Utilizator Andrei_CotorAndrei Cotor Andrei_Cotor Data 9 noiembrie 2016 18:40:23
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <fstream>
#include <vector>
#include <string.h>
using namespace std;
ifstream fi("bfs.in");
ofstream fo("bfs.out");
int n,m,l,s,i,x,y;
vector <int> A[100001];
int V[100001],S[100001],R[100001];

void bfs(int nod)
{
    int i,j;
    memset(R,-1,sizeof(R));
    l=1;
    R[nod]=0;
    S[l]=nod;
    for(i= 1; i<=l; i++)
        for(j=0; j<V[S[i]]; j++)
            if(R[A[S[i]][j]]==-1)
            {
                S[++l]=A[S[i]][j];
                R[S[l]]=R[S[i]]+1;
            }
}

int main()
{
    fi>>n>>m>>s;
    for(i=1; i<=m; i++)
    {
        fi>>x>>y;
        A[x].push_back(y);
    }
    for(i=1; i<=n; i++)
        V[i]=A[i].size();
    bfs(s);
    for(i=1; i<=n; i++)
        fo<<R[i]<<" ";
    fo<<"\n";
    fi.close();
    fo.close();
    return 0;
}