Cod sursa(job #2549380)

Utilizator vladadAndries Vlad Andrei vladad Data 17 februarie 2020 17:27:30
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.87 kb
#include<bits/stdc++.h>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int v[10001], p, u, a[1001][1001], dist[10001], n, m, x, y, X;
bool viz[1001];
void bfs(int nod)
{
    viz[nod]=1;
    p=u=1;
    v[p]=nod;
    while(p<=u)
    {
        nod=v[p];
        p++;
        for(int i=1; i<=n; i++)
        {
            if(!viz[a[nod][i]] && a[nod][i])
            {
                dist[a[nod][i]]=dist[nod]+1;
                viz[a[nod][i]]=1;
                v[++u]=a[nod][i];
            }
        }
    }
}
int main()
{
    f>>n>>m>>X;
    for(int i=1; i<=m; i++)
    {
        f>>x>>y;
        a[x][y]=1;
    }
    bfs(X);
    for(int i=1; i<=n; i++)
    {
        if(X==i)
            g<<0<<' ';
        else if(X!=i && dist[i]==0)
            g<<-1<<' ';
        else
            g<<dist[i]<<' ';
    }
    return 0;
}