Cod sursa(job #1989170)

Utilizator cipri321Marin Ciprian cipri321 Data 6 iunie 2017 12:29:49
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <fstream>
#include <vector>
#include <queue>
#define DIM 100001
using namespace std;
ifstream fi("bfs.in");
ofstream fo("bfs.out");
int n,m,s;
vector<int> V[DIM];
int VIZ[DIM];
int x,y;
queue<int> Q;
int main()
{
    fi>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        fi>>x>>y;
        V[x].push_back(y);
    }
    Q.push(s);
    VIZ[s]=1;
    while(!Q.empty())
    {
        x=Q.front();
        for(int i=0;i<V[x].size();i++)
            if(VIZ[V[x][i]]==false)
            {
                VIZ[V[x][i]]=1+VIZ[x];
                Q.push(V[x][i]);
            }
        Q.pop();
    }
    for(int i=1;i<=n;i++)
        fo<<VIZ[i]-1<<" ";
    fi.close();
    fo.close();
    return 0;
}