Cod sursa(job #1725384)

Utilizator ValentinSavoiuFMI Savoiu Valentin-Marian ValentinSavoiu Data 5 iulie 2016 16:19:56
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 f("bfs.in");
ofstream g("bfs.out");
int n,m,s,x,y,i,l[100001],cost[100001],q[100001];
vector <int> a[100001];
void fabfs(int x)
{
    int i,j,u,p;
    for(i=1;i<=100000;i++) cost[i]=-1;
    u=1; q[u]=x; cost[x]=0;
    for(i=1;i<=u;i++)
    {
        for(j=0;j<l[q[i]];j++)
        {
            if(cost[a[q[i]][j]]==-1)
            {
                q[++u]=a[q[i]][j];
                cost[q[u]]=1+cost[q[i]];
            }
        }
    }
}
int main()
{
    f>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        a[x].push_back(y);
    }
    for(i=1;i<=n;i++) l[i]=a[i].size();
    fabfs(s);
    for(i=1;i<=n;i++) g<<cost[i]<<' ';
    return 0;
}