Cod sursa(job #3214141)

Utilizator AndreiBOTOBotocan Andrei AndreiBOTO Data 13 martie 2024 20:36:20
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.07 kb
#include <bits/stdc++.h>

#pragma optimize GCC ("Ofast")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

///#include <tryhardmode>
///#include <GODMODE::ON>

using namespace std;

ifstream fin ("bfs.in");
ofstream fout ("bfs.out");

const int NMAX=1e5+5;
int dist[NMAX];
int viz[NMAX];

vector<int>v[NMAX];

void bfs(int p)
{
    queue<int>q;
    q.push(p);
    viz[p]=true;
    while(!q.empty())
    {
        int p=q.front();
        q.pop();
        for(auto i:v[p])
        {
            if(!viz[i])
            {
                viz[i]=true;
                dist[i]=dist[p]+1;
                q.push(i);
            }
        }
    }
}
int main()
{
    ios_base::sync_with_stdio(false);
    fin.tie(NULL);
    fout.tie(NULL);

    int n,m,S,i,j,x,y;
    fin>>n>>m>>S;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        v[x].push_back(y);
    }
    bfs(S);
    for(i=1;i<=n;i++)
    {
        if(dist[i]==0 && i!=S)
            fout<<-1<<" ";
        else
            fout<<dist[i]<<" ";
    }
    return 0;
}