Cod sursa(job #2278556)

Utilizator MihneaGhiraMihnea MihneaGhira Data 8 noiembrie 2018 10:58:37
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.75 kb
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int n,m,S,x,y,p,u;
int cost[100010],F[100010],c[100010];
vector <int> v[100010];
int main(){
    fin>>n>>m>>S;
    for(int i=1;i<=m;i++){
        fin>>x>>y;
        v[x].push_back(y);
    }
    F[S]=1;
    c[1]=S;
    p=u=1;
    while(p<=u){
        for(int i=0;i<v[c[p]].size();i++){
            if(F[v[c[p]][i]]==0){
                F[v[c[p]][i]]=1;
                c[++u]=v[c[p]][i];
                cost[v[c[p]][i]]=cost[c[p]]+1;
            }
        }
        p++;
    }
    for(int i=1;i<=n;i++){
        if(cost[i]==0&&i!=S)
            fout<<-1<<" ";
        else
            fout<<cost[i]<<" ";
    }
    return 0;
}