Cod sursa(job #1833225)

Utilizator facelessIonut Balauca faceless Data 21 decembrie 2016 22:03:18
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <bits/stdc++.h>
#define nmax 100001
using namespace std;
vector <int> a[nmax];

int v[nmax],d[nmax];
bool viz[nmax];
int main()
{
    int n,m,s,i,a,b,x,j,c;
    cin>>n>>m>>s;
    for(i=0;i<m;i++)
    {
        cin>>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][y]]])
            {v[++k]=a[v[x][j]];
             viz[v[k]]=1;
             d[v[k]]=d[v[x]]+1;}

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


    return 0;
}