Cod sursa(job #2955837)

Utilizator gabriel.9619Gabriel Stefan Tita gabriel.9619 Data 17 decembrie 2022 22:12:38
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.8 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
int viz[100001], q[100001];
vector <int> l[100001];
int main()
{
    int n, m, i, xs, nod, vecin, p, u, x, y;
    fin>>n>>m>>xs;
    for(i=1;i<=n;i++)
    {
        viz[i]=-1;
    }
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        l[x].push_back(y);
    }
    p=u=1;
    q[u]=xs;
    viz[xs]=0;
    while(p<=u)
    {
        nod=q[p];
        p++;
        for(i=0;i<l[nod].size();i++)
        {
            vecin=l[nod][i];
            if(viz[vecin]==-1)
            {
                u++;
                q[u]=vecin;
                viz[vecin]=viz[nod]+1;
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        fout<<viz[i]<<" ";
    }
    return 0;
}