Cod sursa(job #1336715)

Utilizator cremarencodianaCremarenco Diana cremarencodiana Data 8 februarie 2015 01:26:44
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <cstdio>
#include <vector>
# include <cstring>
using namespace std;
vector <int> v[100010];
int i,p,u,niv[100010],q[100010],poz,x,y,n,m,s;
bool ok[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[p]=s;
     niv[s]=0;
     ok[s]=true;
     while (p<=u)
     {
         poz=q[p];
         for (i=0; i<v[poz].size(); i++)
             if (ok[v[poz][i]]==false)
             {
                 u++;
                 q[u]=v[poz][i];
                 ok[v[poz][i]]=true;
                 niv[v[poz][i]]=niv[poz]+1;
             }
        p++;
     }
     for (i=1; i<=n; i++)
        printf("%d ",niv[i]);
    return 0;
}