Nu aveti permisiuni pentru a descarca fisierul grader_test10.ok

Cod sursa(job #1259093)

Utilizator tudorsTudor Siminic tudors Data 9 noiembrie 2014 18:18:45
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.83 kb
#include <stdio.h>
#include <vector>
#define ma 100010
using namespace std;
 
vector <int> A[ma];
int C[ma],S[ma];
int n,m,s,i,x,y,q;
 
void bf(int nod)
{
    int i,j;
    for (i=1;i<=n;i++)
        C[i]=-1;
    q=1;
    C[nod]=0;
    S[q]=nod;
    for (i=1;i<=q;i++)
        for (j=0;j<A[S[i]].size();j++)
            if (C[A[S[i]][j]]==-1)
            {
                q++;
                S[q]=A[S[i]][j];
                C[S[q]]=C[S[i]]+1;
            }
}
 
int main()
{
    FILE * f;
    f=fopen("bfs.in","r");
    FILE * g;
    g=fopen("bfs.out","w");
     
    fscanf(f,"%d %d %d",&n,&m,&s);
    for (i=1;i<=m;i++)
    {
        fscanf(f,"%d %d",&x,&y);
        A[x].push_back(y);
    }
    bf(s);
    for (i=1;i<=n;i++)
        fprintf(g,"%d ",C[i]);
    fclose(f);
    fclose(g);
    return 0;
}