Cod sursa(job #997367)

Utilizator Adrian1997Radulescu Adrian Adrian1997 Data 13 septembrie 2013 22:00:07
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <fstream>
#include <vector>
#define INF 1000010
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,S,D[100010];
bool viz[100010];

vector<int> L[100010];

int c[100010];

int main(void){
    register int i,p=1,nod,d,u=1,x,y;

    f>>n>>m>>S;
    for(i=1;i<=m;i++){
        f>>x>>y;
        L[x].push_back(y);
    }

    c[p]=S;
    viz[S]=true;
    while(p<=u){
        nod=c[p];
        for(i=0;i<L[nod].size();i++){
            if(!viz[L[nod][i]])
                c[++u]=L[nod][i],D[L[nod][i]]=D[nod]+1,viz[L[nod][i]]=true;
        }
        p++;
    }

    for(i=1;i<=n;i++){
        if(viz[i])
            g<<D[i];
        else
            g<<"-1";
        g<<" ";
    }
    f.close();
    g.close();
    return 0;
}