Cod sursa(job #3230755)

Utilizator Bolfa_DBolfa Diana Bolfa_D Data 22 mai 2024 17:53:41
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.75 kb
#include <bits/stdc++.h>
#define NMAX 200100
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector<int> v[NMAX];
int use[NMAX],n,m,s;

void bfs(int nod)
{
    deque<int> q;

    q.push_back(nod);
    use[nod]=1;
    while(q.empty()==false)
    {
        nod=q.front();
        q.pop_front();
        for(int i=0;i<v[nod].size();++i)
            if(use[v[nod][i]]==0)
            {
                q.push_back(v[nod][i]);
                use[v[nod][i]]=use[nod]+1;
            }
    }
}

int x, y;
int main()
{
    fin>>n>>m>>s;
    for(int i=1;i<=m;++i)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }

    bfs(s);
    for(int i=1;i<=n;++i)
        fout<<use[i]-1<< " ";

    return 0;
}