Cod sursa(job #2530082)

Utilizator vladadAndries Vlad Andrei vladad Data 24 ianuarie 2020 13:12:18
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1 kb
#include<bits/stdc++.h>
#define ll long long
#define fi first
#define sc second
#pragma GCC optimize ("O3")
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
int n, m, x;
vector<int>v[100001];
deque<int>d;
int dis[100001];
bool viz[100001];
void bfs(int nod)
{
    viz[nod]=1;
    d.push_back(nod);
    while(!d.empty())
    {
        nod=d.front();
        d.pop_front();
        for(int i=0; i<v[nod].size(); i++)
        {
            if(!viz[v[nod][i]])
            {
                dis[v[nod][i]]=1+dis[nod];
                viz[v[nod][i]]=1;
                d.push_back(v[nod][i]);
            }
        }
    }
}
int main()
{
    f>>n>>m>>x;
    for(int i=1; i<=m; i++)
    {
        int x1, y;
        f>>x1>>y;
        v[x1].push_back(y);
    }
    bfs(x);
    for(int i=1; i<=n; i++)
    {
        if(i==x)
            g<<0<<' ';
        else if(!dis[i])
            g<<-1<<' ';
        else
            g<<dis[i]<<' ';
    }
    return 0;
}