Cod sursa(job #447351)

Utilizator alexandru92alexandru alexandru92 Data 28 aprilie 2010 15:17:42
Problema BFS - Parcurgere in latime Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
/* 
 * File:   main.cpp
 * Author: virtualdemon
 *
 * Created on April 28, 2010, 3:09 PM
 */
#include <queue>
#include <cstdlib>
#include <fstream>
#include <iterator>
#define Nmax 100011

/*
 * 
 */
using namespace std;
queue< int > Q;
vector< int > G[Nmax];
vector< int >::const_iterator it, iend;
int main(int argc, char** argv)
{
    int N, M, S, x, y;
    ifstream in( "bfs.in" );
    for( in>>N>>M>>S; M; --M )
    {
        in>>x>>y;
        G[x].push_back(y);
    }
    vector< int > d( N+1, -1 );
    for( d[S]=0, Q.push(S); !Q.empty(); )
    {
        x=Q.front(); Q.pop();
        for( it=G[x].begin(), iend=G[x].end(); it < iend; ++it )
            if( -1 == d[*it] )
            {
                d[*it]=d[x]+1;
                Q.push( *it );
            }
    }
    ofstream out( "bfs.out" );
    copy( d.begin()+1, d.end(), ostream_iterator<int>( out, " " ) );
    out<<'\n';
    return (EXIT_SUCCESS);
}