Cod sursa(job #2218472)

Utilizator petru123456789Petru B petru123456789 Data 4 iulie 2018 16:07:15
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.01 kb
#include <bits/stdc++.h>

using namespace std;
vector<int> v[100001];
int viz[100001],i,j,n,q[100001],s,m,x,y,p,u,e,r;

int main()
{
    ifstream in("bfs.in");
    ofstream out("bfs.out");
    in>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        in>>x>>y;
        v[x].push_back(y);
    }
    /*for(i=1;i<=n;i++)
    {
        for(j=0;j<v[i].size();j++)
        {
            cout<<v[i][j]<<' ';
        }
        cout<<'\n';
    }*/
    for(i=1;i<=n;i++)
    {
        viz[i]=2000000000;
    }
    viz[s]=0;
    q[1]=s;
    p=1;
    u=1;
    while(p<=u) //<=
    {
        r=q[p];
        for(i=0;i<(v[r].size());i++)
        {
            e=v[r][i];
           // cout<<e<<' ';

            if(viz[r]+1<viz[e])
            {
                viz[e]=viz[r]+1;
                u++;
                q[u]=e;


            }
        }
        p++;
    }
    for(i=1;i<=n;i++)
    {
        if(viz[i]!=2000000000)
            out<<viz[i]<<' ';
        else
            out<<"-1 ";
    }
}