Cod sursa(job #1880284)

Utilizator miruna1224Floroiu Miruna miruna1224 Data 15 februarie 2017 17:33:31
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");

const int N=100001;
int d[N],n,s,q[N];

vector <int> a[N];

int sub(int s)
{
    int i,p=0,u=-1, x, y;
    for(i=1; i<=n; i++)
        d[i]=-1;
    q[++u]=s;
    d[s]=0;
    while(p<=n)
    {
        x=q[p++];
        for(i=0; i<a[x].size(); i++)
        {
            y=a[x][i];
            if(d[y]==-1)
            {
                q[++u]=y;
                d[y]=1+d[x];
            }
        }
    }
}

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

    sub(s);
    for(i=1; i<=n; i++)
        g<<d[i]<<" ";
    return 0;
}