Cod sursa(job #2267173)

Utilizator Vlad_FuioreaVlad - Stefan Fuiorea Vlad_Fuiorea Data 23 octombrie 2018 13:16:21
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.74 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("bfs.in");
ofstream cout("bfs.out");
vector <int> v[100001];
int viz[100001],q[1000001],n,m,s,i,x,y;
void coada(int x)
{
    int p,u,k,i;
    p=u=1;
    q[p]=x;
    viz[x]=1;
    while(p<=u)
    {
        k=q[p];
        p++;
        for(i=0;i<v[k].size();i++)
        {
            if(viz[v[k][i]]==0){
                u++;
                q[u]=v[k][i];
                viz[v[k][i]]=viz[k]+1;
            }
        }
    }
}
int main()
{
    cin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        cin>>x>>y;
        v[x].push_back(y);
        //v[y].push_back(x);
    }
    coada(s);
    for(i=1;i<=n;i++)
        cout<<viz[i]-1<<" ";
    return 0;
}