Cod sursa(job #2130212)

Utilizator stefanidisstefan27Stefanidis Stefan stefanidisstefan27 Data 13 februarie 2018 15:35:24
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.74 kb
#include <fstream>
#include <vector>

using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");

const int N= 100001;
vector <int> a[N];

int m, n, q[N], d[N], st, dr= -1, s;

void citire()
{
    int x, y;
    in>>n>>m>>s;
    for(int i=0; i<m; i++)
    {
        in>>x>>y;
        a[x].push_back(y);
    }
}

int main()
{
    citire();

    int x, y;
    for(int i=1; i<=n; i++)
        d[i]= -1;

    q[++dr]= s;
    d[s]= 0;
    while(st <= dr)
    {
        x= q[st++];
        for(int i=0; i<a[x].size(); i++)
        {
            y= a[x][i];
            if(d[y] == -1)
            {
                q[++dr]= y;
                d[y]= 1+d[x];
            }
        }
    }

    for(int i=1; i<=n; i++)
        out<<d[i]<<' ';

    return 0;
}