Cod sursa(job #1563348)

Utilizator catalin9898Bajenaru Catalin catalin9898 Data 5 ianuarie 2016 22:19:57
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <vector>
#include <cstdio>
#include <queue>
using namespace std;
int viz[100001];
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    int n,m,i,p,u,x,a,b;
    scanf("%d%d%d",&n,&m,&x);
    queue<int>coada;
   vector <int>v[100001];
    vector <int>::const_iterator s,j;
    viz[x]=1;

    for(i=1; i<=m; i++)
    {
        scanf("%d%d",&a,&b);
        v[a].push_back(b);
    }
    coada.push(x);
    b=0;

    while(!coada.empty())
    {
        a=coada.front();
        coada.pop();
        for(s=v[a].begin(),j=v[a].end(); s!=j; s++)
        {
            if(viz[*s]==0)
            {
                viz[*s]=viz[a]+1;
                coada.push(*s);
            }


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

    return 0;
}