Cod sursa(job #2746882)

Utilizator PrizlopanIustinPrizlopan Iustin George PrizlopanIustin Data 28 aprilie 2021 17:25:58
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.98 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
int s=0,n,m,x,y,i,nr,maxi=-609,benis,a,b,b1,b2,visitat[100001];
vector<int>v[100001];
vector<int>bn;
void filix(int x)
{
    int st,dr;
    st=dr=0;
    bn.push_back(x);
    visitat[x]=1;
    while(st<=dr)
    {
        int z=bn[st];
        for(i=0; i<v[z].size(); i++)
            if(visitat[v[z][i]]==0)
            {
                visitat[v[z][i]]=visitat[z]+1;
                bn.push_back(v[z][i]);
                dr++;
            }
        st++;
    }
}

int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");
    in>>n>>m>>x;
    for(i=1; i<=m; i++)
    {
        in>>a>>b;
        //v[b].push_back(a);
        v[a].push_back(b);
    }
    filix(x);
    for(i=1; i<=n; i++)
    {
        //if(i!=x)
            if(visitat[i]==0)
                out<<-1<<' ';
            else
                out<<visitat[i]-1<<' ';

    }
    return 0;
}
//adiacenta