Cod sursa(job #429837)

Utilizator alexandru92alexandru alexandru92 Data 30 martie 2010 15:19:49
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
/* 
 * File:   main.cpp
 * Author: SpeeDemon
 *
 * Created on March 30, 2010, 3:02 PM
 */
#include <stack>
#include <vector>
#include <fstream>
#include <iterator>

/*
 *
 */
using namespace std;
vector< int > v;
vector< bool > uz;
vector< vector< int > > G;
inline void DFS( int x )
{
    vector< int >::const_iterator it, iend;
    uz[x]=true;
    for( it=G[x].begin(), iend=G[x].end(); it < iend; ++it )
        if( !uz[*it] )
            DFS( *it );
    v.push_back(x+1);
}
int main( void )
{
    int N, M, i, j;
    ifstream in( "sortaret.in" );
    in>>N>>M;
    G.resize(N);
    uz.resize(N);
    for( ; M; --M )
    {
        in>>i>>j;
        --i, --j;
        G[i].push_back(j);
    }
    for( i=0; i < N; ++i )
        if( !uz[i] )
            DFS(i);
    ofstream out( "sortaret.out" );
    copy( v.rbegin(), v.rend(), ostream_iterator<int>( out, " " ) );
    return EXIT_SUCCESS;
}