Cod sursa(job #2102837)

Utilizator tiberiu.bucur17Tiberiu Constantin Emanoil Bucur tiberiu.bucur17 Data 9 ianuarie 2018 15:33:10
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <cstdio>
#include <vector>
#define MAXN 100000
using namespace std;
bool viz[MAXN];
int q[MAXN],dist[MAXN],st,dr;
vector <int> v[MAXN];
inline void bfs(int s)
{
    int x,y;
    q[dr++]=s;viz[s]=true;
    while(st<dr)
    {
        x=q[st++];
        for(unsigned int i=0;i<v[x].size();i++)
        {
            y=v[x][i];
            if(!viz[y])
                q[dr++]=y,dist[y]=dist[x]+1,viz[y]=true;
        }
    }
}
int main()
{
    FILE *fin,*fout;
    fin=fopen("bfs.in","r");
    fout=fopen("bfs.out","w");
    int n,m,s,x,y;
    fscanf(fin,"%d%d%d",&n,&m,&s);
    for(int i=0;i<m;i++)
    {
        fscanf(fin,"%d%d",&x,&y);
        v[x-1].push_back(y-1);
    }
    bfs(s-1);
    for(int i=0;i<n;i++)
        if(viz[i])
            fprintf(fout,"%d ",dist[i]);
        else
            fprintf(fout,"-1 ");
    fclose(fin);
    fclose(fout);
    return 0;
}