Cod sursa(job #1192419)

Utilizator PlatenitesVoicu Cristian Platenites Data 28 mai 2014 22:53:42
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.69 kb
#include <fstream>
#include <vector>

using namespace std;

ifstream f("bfs.in");
ofstream g("bfs.out");
int viz[100001],c[100001],p,u,i,n,m,a,b,x;
vector<int>v[100001];
int main()
{
    f>>n>>m>>x;
    for(i=1;i<=m;i++)
    {
        f>>a>>b;
        v[a].push_back(b);
    }
    p=u=1;
    c[p]=x;viz[x]=1;
    while(p<=u)
    {
        for(i=0;i<v[c[p]].size();i++)
            if(viz[v[c[p]][i]]==0)
            {
                c[++u]=v[c[p]][i];
                viz[v[c[p]][i]]=viz[c[p]]+1;
            }
            p++;
    }
    for(i=1;i<=n;i++)
        if(x!=i && viz[i]==0)
            g<<-1<<" ";
        else
            g<<viz[i]-1<<" ";
    return 0;
}