Cod sursa(job #2112420)

Utilizator cmarius46Mihail Vlahuta cmarius46 Data 23 ianuarie 2018 14:18:31
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <iostream>
#include <fstream>
#include <vector>
#define pb push_back
using namespace std;
int c[100005],n,m,s,i,x,y,viz[100005],prim,ultim,p;
vector <int> a[100005];
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);

    scanf("%d%d%d",&n,&m,&s);

    for(i=1;i<=m;i++)
    {
        scanf("%d%d",&x,&y);
        a[x].pb(y);
        //a[y].pb(x);
    }
    //cout<<"DA";
    viz[s]=1;
    c[0]=s;
    prim=ultim=0;
    while(prim<=ultim)
    {
        p=c[prim++];
        //cout<<p;
        m=a[p].size();
        for(i=0;i<m;i++)
        {
            if(!viz[a[p][i]])
            {
                viz[a[p][i]]=viz[p]+1;
                c[++ultim]=a[p][i];
            }
        }

    }

    for(i=1;i<=n;i++)
        if(!viz[i])
            printf("-1 ");
        else
            printf("%d ",viz[i]-1);


    return 0;
}