Cod sursa(job #1722858)

Utilizator stefan.botezStefan Botez stefan.botez Data 29 iunie 2016 09:47:48
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <fstream>
#include <vector>
#include <string.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,l,b;
vector <int> a[100005];
int s[100005],c[100005],v[100005];
void BFS(int nod)
{
    int i,j;
    memset(v,-1,sizeof(v));
    l=1;
    v[nod]=0;
    c[l]=nod;
    for(i=1;i<=l;i++)
        for(j=0;j<s[c[i]];j++)
            if(v[a[c[i]][j]]==-1)
            {
                c[++l]=a[c[i]][j];
                v[c[l]]=v[c[i]]+1;
            }
}
int main()
{
    int i,x,y;
    f>>n>>m>>b;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x].push_back(y);
    }
    for(i=1;i<=n;i++)
        s[i]=a[i].size();
    BFS(b);
    for(i=1;i<=n;i++)
        g<<v[i]<<" ";
    return 0;
}