Cod sursa(job #1216985)

Utilizator ValeraShulghin Valera Valera Data 6 august 2014 11:42:11
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");

int n,m,viz[100001],c[100001];
vector < vector<int> > a(100001);
vector <int> rez(100001,-1);

void BFS(int x)
{
    int p=0,u=0,i;
    c[0]=x;
    viz[x]=1;
    rez[x]=0;
    while(p<=u)
    {
        x=c[p++];
        for(i=0;i<a[x].size();i++)
            if(!viz[a[x][i]])
            {
                c[++u]=a[x][i];
                viz[a[x][i]]=1;
                rez[a[x][i]]=rez[x]+1;
            }
    }
    for(i=1;i<=n;i++)
        g<<rez[i]<<" ";
}

int main()
{
    int x,y,i,j,s;
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x].push_back(y);
    }

    BFS(s);

    return 0;
}