Cod sursa(job #990889)

Utilizator BlackLordFMI Alex Oprea BlackLord Data 29 august 2013 10:26:16
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.67 kb
#include <fstream>
#include <vector>
#define DIM 100010
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n, m, s, x, y, i, j, v[DIM], c[DIM], p, u;

vector<int> L[DIM];

int main(){
    f>>n>>m>>s;
    for(i=1; i<=m; i++)
    {
        f>>x>>y;
        L[x].push_back(y);
    }
    p=1;
    u=1;
    c[1]=s;
    v[s]=1;
    while(p<=u)
    {
        x=c[p];
        for(i=0; i<L[x].size(); i++)
            if(v[ L[x][i] ]==0)
            {
                v[ L[x][i] ]=v[ c[p] ]+1;
                c[++u]=L[x][i];
            }
        p++;
    }
    for(i=1; i<=n; i++)
        g<<v[i]-1<<' ';
    g<<"\n";
    return 0;
}