Cod sursa(job #1456457)

Utilizator TibixbAndrei Tiberiu Tibixb Data 30 iunie 2015 21:53:53
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;
vector <int> L[100007];
int x, y, i, n, m2, s, p, u, m[100007], q[100007], nod, fiu;
ifstream in("bfs.in");
ofstream out("bfs.out");
int main(){
    in>>n>>m2>>s;
    for(i=1; i<=m2; i++){
        in>>x>>y;
        L[x].push_back(y);
    }
    m[s]=1;
    p=1; u=1;
    q[1]=s;
    while(p<=u){
        nod=q[p];
        for(i=0; i<L[nod].size(); i++){
            fiu=L[nod][i];
            if(m[fiu]==0){
                q[++u]=fiu;
                m[fiu]=m[nod]+1;
            }
        }
        p++;
    }
    for(i=1; i<=n; i++)
        out<<m[i]-1<<" ";
    return 0;
}