Cod sursa(job #2432176)

Utilizator anamariatoaderAna Toader anamariatoader Data 22 iunie 2019 14:18:40
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.82 kb
#include <fstream>
#include <cstring>
#include <vector>
#include <deque>

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

int n,m,s,x,y,i,q[100005],d[100005];
bool viz[100005];
vector <int> g[100005];

void coada(){
    viz[s]=1;
    int p=1,u=1;
    q[p]=s;
    d[s]=0;
    while(p<=u){
        int nod=q[p];
        for(int i=0;i<g[nod].size();i++)
            if(viz[g[nod][i]]==0){
                q[++u]=g[nod][i];
                d[g[nod][i]]=d[nod]+1;
                viz[g[nod][i]]=1;
            }
        p++;
    }
}

int main()
{
    fin>>n>>m>>s;
    for(i=1;i<=m;i++){
        fin>>x>>y;
        g[x].push_back(y);
    }
    coada();
    for(i=1;i<=n;i++){
       if(!viz[i])
         fout<<-1<<' ';
       else
         fout<<d[i]<<' ';
    }
    return 0;
}