Cod sursa(job #1251438)

Utilizator MacWonkMihai Alexandru Cosmin MacWonk Data 29 octombrie 2014 14:50:06
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.77 kb
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream f("bfs.in");
ofstream g("bfs.out");
vector <int> A[100010];
int C[100010],viz[100010],n,m,s,i,x,y;
void bfs(int pr)
{
    int p,u,x,i;
    memset(viz,-1,sizeof(viz));
    C[1]=pr;
    p=u=1;
    viz[pr]=0;
    while(p<=u)
    {
        x=C[p];
        for(i=0;i<A[x].size();++i)
        {
            if(viz[A[x][i]]==-1)
            {
                ++u;
                C[u]=A[x][i];
                viz[A[x][i]]=viz[x]+1;
            }
        }
        ++p;
    }
}
int main()
{
    f>>n>>m>>s;
    for(i=1;i<=m;++i)
    {
        f>>x>>y;
        A[x].push_back(y);
    }
    bfs(s);
    for(i=1;i<=n;++i) g<<viz[i]<<" ";
    g<<'\n';
    return 0;
}