Cod sursa(job #2133162)

Utilizator AndreiCroitoruAndrei Croitoru AndreiCroitoru Data 16 februarie 2018 16:50:17
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("bfs.in");
ofstream out("bfs.out");
const int N=100001;
vector <int> a[N];
int d[N],m,s,q[N];
unsigned n;
int main()
{
    int x,y;
    in>>n>>m>>s;
    for(int i=0;i<m;i++)
    {
        in>>x>>y;
        a[x].push_back(y);
    }
    unsigned i;
    int st=0,dr=-1;
    for(i=1;i<=n;i++)
        d[i]=-1;
    q[++dr]=s;
    d[s]=0;
    while(st<=dr)
    {
        x=q[st++];
        for(i=0;i<a[x].size();i++)
            {
                y=a[x][i];
                if(d[y]==-1)
                {
                    q[++dr]=y;
                    d[y]=1+d[x];
                }
            }
    }
    for(i=1;i<=n;i++)
        out<<d[i]<< ' ';
    return 0;
}