Cod sursa(job #1025564)

Utilizator BartieSocaciu Vlad Bartie Data 10 noiembrie 2013 11:28:10
Problema BFS - Parcurgere in latime Scor 50
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <iostream>
#include <fstream>
using namespace std;

ifstream fin("bfs.in");
ofstream fout("bfs.out");

int mat[1002][1002],minim[1002]={0},verif[1002]={0},n,m,k;
int main()
{
    fin>>n>>m>>k;
    int a,b;
    for(int i=0;i<m;i++){
        fin>>a>>b;
        mat[a][b]=1;
    }
    int coada[1002],st=0,dr=0;
    coada[dr]=k;dr++;verif[k]=1;
    while(st<dr){
        for(int i=1;i<=n;i++)
            if(mat[coada[st]][i]==1 && verif[i]==0){
                minim[i]=minim[coada[st]]+1;
                coada[dr]=i;dr++;
                verif[i]=1;
            }
        st++;
    }
    for(int i=1;i<=n;i++)
        if(minim[i]==0)
            minim[i]=-1;
    minim[k]=0;
    for(int i=1;i<=n;i++)
        fout<<minim[i]<<" ";
    return 0;
}