Cod sursa(job #788554)

Utilizator round2Test P round2 Data 15 septembrie 2012 12:59:39
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <cstdio>
#include <vector>
using namespace std;
#define pb push_back
#define Max 100001

vector<int>v[Max];
int n,d[Max],c[Max],s;
bool was[Max];

void parcurg()
{
    int p,u,x,y;
    c[1]=s;
    was[s]=1;
    p=u=1;
    while(p<=u)
    {
        x=c[p++];
        for(int i=0;i<v[x].size();i++)
        {
            y=v[x][i];
            if(was[y]==0)
            {
                was[y]=1;
                d[y]=d[x]+1;
                c[++u]=y;
            }
        }
    }
}

int main()
{
    int m,x,y;
    freopen("bfs.in","r",stdin);
    freopen("bfs.out","w",stdout);
        scanf("%d %d %d",&n,&m,&s);
        while(m--)
        {
            scanf("%d %d",&x,&y);
            v[x].pb(y);
        }
    parcurg();
    for(int i=1;i<=n;i++)
    if(i==s)printf("0 "); else printf("%d ",d[i]==0?-1:d[i]);
    return 0;
}