Cod sursa(job #2510460)

Utilizator Vladymyr11Pechi Vladimir Stefan Vladymyr11 Data 16 decembrie 2019 18:58:31
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.88 kb
#include <fstream>
#include <vector>
using namespace std;
vector <int> v[100001];
int dist[100001],c[100001];
bool viz[100001];
int main()
{
    ifstream fin ("bfs.in");
    ofstream fout ("bfs.out");
    int n,m,x,y,s,p=1,u=1;
    fin>>n>>m>>s;
    for (int i=1;i<=m;i++)
        {
        fin>>x>>y;
        v[x].push_back(y);
        }
    c[u]=s;
    viz[s]=1;
    while (p<=u)
        {
        int vf=c[p];
        p++;
        int l=v[vf].size();
        for (int i=0;i<l;i++)
            {
            if (viz[v[vf][i]]==0)
                {
                u++;
                c[u]=v[vf][i];
                viz[v[vf][i]]=1;
                dist[v[vf][i]]=dist[vf]+1;
                }
            }
        }
    for (int i=1;i<=n;i++)
        if (viz[i]==0)
            fout<<-1<<" ";
        else
            fout<<dist[i]<<" ";
    return 0;
}