Cod sursa(job #1268778)

Utilizator TibixbAndrei Tiberiu Tibixb Data 21 noiembrie 2014 14:40:11
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include<fstream>
#include<vector>
using namespace std;
int n, m2, xx, i, nod, fiu, m[100007], c[100007], x, y, p, u;
vector <int> L[100007];
ifstream in("bfs.in");
ofstream out("bfs.out");
int main(){
    in>>n>>m2>>xx;
    for(i=1; i<=m2; i++){
        in>>x>>y;
        L[x].push_back(y);
    }
    m[xx]=1;
    p=u=1;
    c[1]=xx;
    while(p<=u){
        nod=c[p];
        for(i=0; i<L[nod].size(); i++){
            fiu=L[nod][i];
            if(m[fiu]==0){
                c[++u]=fiu;
                m[fiu]=m[nod]+1;
            }
        }
        p++;
    }
    for(i=1; i<=n; i++)
        out<<m[i]-1<<" ";
return 0;
}