Cod sursa(job #3002461)

Utilizator cezarinfoTulceanu Cezar cezarinfo Data 14 martie 2023 20:06:10
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.84 kb
#include<cstdio>
#include<vector>
#include<queue>
#include<cstring>
using namespace std;
FILE*in=fopen("bfs.in","r");
FILE*out=fopen("bfs.out","w");
const int NMAX=100007;
vector<int> adj[NMAX];
int n,m,s,i,j,x,y,a;
queue<int> q;
bool b[NMAX];
int d[NMAX];
void bfs()
{
    while(!q.empty())
    {
        a=q.front();
        q.pop();
        for(auto t:adj[a])
        {
            if(b[t]==0)
            {
                d[t]=d[a]+1;
                b[t]=1;
                q.push(t);
            }
        }
    }
}
int main()
{
    fscanf(in,"%d%d%d",&n,&m,&s);
    q.push(s);
    b[s]=1;
    memset(d,-1,sizeof(d));
    d[s]=0;
    for(i=1;i<=m;i++)
    {
        fscanf(in,"%d%d",&x,&y);
        adj[x].push_back(y);
    }
    bfs();
    for(i=1;i<=n;i++)
    {
        fprintf(out,"%d ",d[i]);
    }
}