Cod sursa(job #1833246)

Utilizator facelessIonut Balauca faceless Data 21 decembrie 2016 22:52:04
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.73 kb
#include <bits/stdc++.h>
#include <vector>
#define nmax 100001
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int> a[nmax];
int v[nmax],d[nmax];
bool viz[nmax];
int main()
{
    int n,m,s,i,b,x,j,c;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        int c,b;
        fin>>c>>b;
        a[c].push_back(b);
    }
    for(i=0;i<n;i++) d[i]=-1;
    viz[s]=1; v[1]=s;
    int k=1;
    d[s]=0;
    for(i=1;i<=k;i++)
    {
        for(j=0;j<a[v[x]].size();j++)
        {
            if(!viz[a[v[x]][j]])
            {v[++k]=a[v[x]][j];
             viz[v[k]]=1;
             d[v[k]]=d[v[x]]+1;}

        }
    }
    for(i=0;i<n;i++)
        fout<<d[i]<<" ";


    return 0;
}