Cod sursa(job #1519153)

Utilizator Marius7122FMI Ciltea Marian Marius7122 Data 6 noiembrie 2015 21:55:19
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <stdio.h>
#include <vector>
using namespace std;
vector<long> mat[100001];
long n,m,i,x,y,s,li,ls,dist[100001],c[100001];
int main()
{
    FILE*f1,*f2;
    f1=fopen("bfs.in","r");
    f2=fopen("bfs.out","w");
    fscanf(f1,"%ld%ld%ld",&n,&m,&s);
    for(i=0;i<m;i++)
    {
        fscanf(f1,"%ld%ld",&x,&y);
        mat[x].push_back(y);
    }
    c[0]=s;dist[s]=1;
    while(li<=ls)
    {
        x=c[li];
        li++;
        y=mat[x].size();
        for(i=0;i<y;i++)
            if(dist[mat[x][i]]==0)
            {
                c[++ls]=mat[x][i];
                dist[mat[x][i]]=dist[x]+1;
            }
    }
    for(i=1;i<=n;i++)
        fprintf(f2,"%ld ",dist[i]-1);
    return 0;
}