Cod sursa(job #952459)

Utilizator primulDarie Sergiu primul Data 23 mai 2013 15:31:27
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.88 kb
#include <cstdio>
# include <cstring>
# include <vector>
 
using namespace std;
vector <int> v[100010];
int i,n,m,x,y,p,u,niv[100010],q[100010],s,nod;
bool use[100010];
int main()
{
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
    scanf("%d %d %d\n",&n,&m,&s);
    for (i=1; i<=m; i++)
    {
        scanf("%d %d\n",&x,&y);
        v[x].push_back(y);
    }
 
    memset(niv,-1,sizeof(niv));
    p=u=1;
    q[u]=s;
    niv[s]=0;
    use[s]=true;
    while (p<=u)
    {
        nod=q[p];
        for (i=0; i<v[nod].size(); ++i)
             if (use[v[nod][i]]==false)
             {
                 niv[v[nod][i]]=niv[nod]+1;
                 use[v[nod][i]]=true;
                 u++;
                 q[u]=v[nod][i];
             }
        p++;
    }
    for (i=1; i<=n; i++)
        printf("%d ",niv[i]);
    printf("\n");
    return 0;
}