Cod sursa(job #892548)

Utilizator robert.onesimRobert Onesim robert.onesim Data 26 februarie 2013 10:30:33
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("bfs.in");
ofstream fout("bfs.out");
vector <int>L[100001];
struct codita
{
    int nr,cost;
    bool ok;
} C[100001],viz[100001];
int n,m,s,ic,sc,v,v1,i;
void bfs(int x)
{
    C[1].nr=x; C[1].cost=0;viz[x].ok=1;viz[x].cost=0;
    ic=1;sc=1;
    while(ic<=sc)
    {
        v=C[ic].nr;
        v1=C[ic++].cost;
        for(i=0;i<L[v].size();i++)
        {
            if(viz[L[v][i]].ok==0)
            {
               C[++sc].nr=L[v][i];C[sc].cost=v1+1;
               viz[L[v][i]].ok=1; viz[L[v][i]].cost=v1+1;
            }
        }
    }
    for(i=1;i<=n;i++)
    {
        if(viz[i].cost==0&&i!=s) fout<<"-1"<<" ";
        else fout<<viz[i].cost<<" ";
    }

}

int main()
{
    int x,y;
    fin>>n>>m>>s;
    for(i=1;i<=m;i++)
    {
        fin>>x>>y;
        L[x].push_back(y);
    }
    bfs(s);
}