Cod sursa(job #1629783)

Utilizator SebiCarhatCarhat Eusebiu SebiCarhat Data 4 martie 2016 18:31:25
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <fstream>
#include<bitset>
#include<queue>
#define NMAX 100005
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector<int> a[NMAX];
int rez[NMAX];
bitset<NMAX> viz;
queue <int> q;
int N,M,S;
void bf(int x)
{
    int nod;
    q.push(x);
    while(!q.empty())
    {
        nod=q.front();
        q.pop();
        for(int i=0;i<a[nod].size();++i)
        if(viz[a[nod][i]]==0)
        {
        viz[a[nod][i]]=1;
        q.push(a[nod][i]);
        rez[a[nod][i]]=rez[nod]+1;
        }
    }
}
int main()
{
    int x,y;
    f>>N>>M>>S;
    for(int i=1;i<=M;++i)
    {
        f>>x>>y;
        a[x].push_back(y);
        //a[y].push_back(x);
    }
    rez[S]=1;
    viz[S]=1;
        bf(S);
    for(int i=1;i<=N;++i)
        g<<rez[i]-1<<" ";
    return 0;
}