Cod sursa(job #1049548)

Utilizator SilviussMezei Silviu Silviuss Data 7 decembrie 2013 15:13:06
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.63 kb
#include <fstream>
#include <vector>

using namespace std;

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

int main()
{
    vector<int> v[100001];
    int n,m,s,i,j,*a,*u;
    fin>>n>>m>>s;
    a=new int[n+1];
    u=new int[m];
    for(i=1;i<=n;++i)
        a[i]=-1;
    while(m)
    {
        fin>>i>>j;
        v[i].push_back(j);
        m--;
    }
    for(j=0,a[s]=0,u[0]=s;j<=m;++j)
        for(i=0;i<v[u[j]].size();++i)
            if(a[v[u[j]][i]]==-1)
            {
                a[v[u[j]][i]]=a[u[j]]+1;
                u[++m]=v[u[j]][i];
            }
    for(i=1;i<=n;++i)
        fout<<a[i]<<" ";
}