Cod sursa(job #1485817)

Utilizator DeltaMTP Dragos DeltaM Data 13 septembrie 2015 02:51:32
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include<cstdio>
#include<vector>
using namespace std;
vector<int>L[100100];
int n,m,s,i,j,a,p,u,b,q[100100],l[100100],v[100100];
FILE *f,*g;
int main(){
    f=fopen("bfs.in","r");
    g=fopen("bfs.out","w");
    fscanf(f,"%d%d%d",&n,&m,&s);
    for(i=1;i<=m;i++){
        fscanf(f,"%d%d",&a,&b);
        L[a].push_back(b);
    }
    p=u=1;
    q[1]=s;
    l[s]=0;
    v[s]=1;
    while(p<=u){
        a=q[p];
        for(int i=0;i<L[a].size();i++){
            if( v[ L[a][i] ] == 0 ){
                q[++u]=L[a][i];
                l[ L[a][i] ]=l[a]+1;
                v[ L[a][i] ]=1;
            }
        }
        p++;
    }
    for(i=1;i<=n;i++){
        if(v[i]==0)
            fprintf(g,"-1 ");
        else
            fprintf(g,"%d ",l[i]);
    }
    fclose(f);
    fclose(g);
    return 0;
}