Cod sursa(job #1832925)

Utilizator RaduXD1Nicolae Radu RaduXD1 Data 21 decembrie 2016 10:58:29
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include<fstream>
#include<vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int> v[100010];
int vecin,nod,c[100010],u,p,d[100010],x,y,i,n,m,s;

int main(){
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    p=1;
    u=1;
    c[1]=s;
    d[s]=1;
    while(p<=u)
    {
        nod=c[p];
        for(i=0;i<v[nod].size();i++)
        {
            vecin=v[nod][i];
            if(d[vecin]==0)
            {
                u++;
                c[u]=vecin;
                d[vecin]=1+d[nod];
            }
        }
        p++;
    }
    for(i=1;i<=n;i++)
        fout<<d[i]-1<<" ";
    fin.close();
    fout.close();
    return 0;
}