Cod sursa(job #1511174)

Utilizator paulyooCarcea Paul paulyoo Data 26 octombrie 2015 09:48:44
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#define nmax 100001
#include <fstream>
#include <vector>

using namespace std;

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

vector <int>b[nmax];
int p,u,i,k,w,c[100001],viz[100001],n;
void BF(int x)
{

    c[1]=x;
    p=u=1;
    viz[x]=1;
    while(p<=u)
    {
        k=c[p]; p++;
        for(i=0;i<b[k].size();i++)
        {
            w=b[k][i];
            if(!viz[w])
            {
                u++;
                c[u]=w;
                viz[w]=viz[k]+1;
            }
        }
    }
}



int main()
{
    int n,m,s,i,y,x;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        b[x].push_back(y);
    }
    BF(s);
    for(i=1;i<=n;i++)
        fout<<viz[i]-1<<' ';
    return 0;
}