Cod sursa(job #2043492)

Utilizator GladrasGrigoriu Stefan-Cosmin Gladras Data 20 octombrie 2017 09:38:58
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#define NM 100001

using namespace std;

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

int n,m,s;
int viz[NM],c[NM];

vector<int> G[NM];

int main()
{
    int i,j,x,y;
    int p,u,z,w;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        if(x!=y)
            G[x].push_back(y);
    }
    viz[s]=1;
    p=u=1;
    c[1]=s;
    while(p<=u)
    {
        z=c[p];
        p++;
        for(i=0;i<G[z].size();i++)
        {
            w=G[z][i];
            if(!viz[w])
            {
                viz[w]=viz[z]+1;
                u++;
                c[u]=w;
            }
        }
    }
    for(i=1;i<=n;i++)
        fout<<viz[i]-1<<" ";
}