Cod sursa(job #1737924)

Utilizator tudor_bonifateTudor Bonifate tudor_bonifate Data 5 august 2016 12:38:06
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <cstdio>
#include <vector>
#include <queue>
#define NMAX 100005
using namespace std;
vector <int> g[NMAX];
queue <int> q;
int drum[NMAX],i,n,m,s,x,y,crt;
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].push_back(y);
    }
    for (i=1; i<=n; i++) drum[i]=-1;
    drum[s]=0;
    q.push(s);
    while (!q.empty())
    {
        crt=q.front();
        q.pop();
        for (i=0; i<g[crt].size(); i++)
        {
            if (drum[g[crt][i]]==-1)
            {
                drum[g[crt][i]]=drum[crt]+1;
                q.push(g[crt][i]);
            }
        }
    }
    for (i=1; i<=n; i++) printf("%d ",drum[i]);
    return 0;
}