Cod sursa(job #991473)

Utilizator horatiu11Ilie Ovidiu Horatiu horatiu11 Data 30 august 2013 15:54:33
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.79 kb
# include <cstdio>
# include <queue>
# include <vector>
# define pb push_back
using namespace std;
int n,m,s,i,viz[100001],x,y;
queue <int>q;
vector <int>G[100001];
void bfs(int x)
{
    int i;
    q.push(x);viz[x]=1;
    while(!q.empty())
    {
        x=q.front(); q.pop();
        for(i=0;i<G[x].size();++i)
        {
            if(!viz[G[x][i]])
            {
                q.push(G[x][i]);
                viz[G[x][i]]=viz[x]+1;
            }
        }
    }
}
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);
        G[x].pb(y);
    }
    bfs(s);
    for(i=1;i<=n;++i)
        printf("%d ",viz[i]-1);
    printf("\n");
    return 0;
}