Cod sursa(job #2131155)

Utilizator mateiuMateiu Ioan mateiu Data 14 februarie 2018 13:55:53
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
vector <int > v[100002];
ifstream f("bfs.in");
ofstream g("bfs.out");
int n,m,s;
int viz[100002],coada[100002];
void bf(int st)
{
    int pi,ps,x,i;
    coada[1]=st;
    ps=pi=1;
    while(ps<=pi)
    {
        x=coada[ps];
        for(int i=0;i<v[x].size();i++)
        {
            if(viz[v[x][i]]==-1)
            {
                viz[v[x][i]]=viz[x]+1;
                coada[++pi]=v[x][i];
            }
        }
        ps++;
    }
}
int main()
{
    int x,y,s;
    f>>n>>m>>s;
    for(int i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
    {
        viz[i]=-1;
    }
    viz[s]=0;
    bf(s);
    for(int i=1;i<=n;i++)
    {
        g<<viz[i]<<" ";
    }
    return 0;
}