Cod sursa(job #2358849)

Utilizator BigBoss_29Matei Cristian BigBoss_29 Data 28 februarie 2019 13:33:08
Problema BFS - Parcurgere in latime Scor 30
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.76 kb
#include <bits/stdc++.h>
using namespace std;
 
ifstream fin("bfs.in");
ofstream fout("bfs.out");
 
vector <int> v[100];
int c[100],viz[100],dist[100];
int n,m,s;
void bfs(int x)
{
    int p,u;
    p=u=1;
    c[u]=x; viz[x]=1; dist[x]=0;
    while(p<=u)
    {
        x=c[p++];
        for(auto i:v[x])
        {
            if(viz[i]==0)
            {
                dist[i]=dist[x]+1;
                viz[i]=1;
                c[++u]=i; 
            }
        }
    }
}
 
int main()
{
    int x,y,i;
    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(viz[i]==1) fout<<dist[i]<<" ";
        else fout<<-1<<" ";
    }
    return 0;
}