Cod sursa(job #446013)

Utilizator alexandru92alexandru alexandru92 Data 24 aprilie 2010 19:23:14
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.02 kb
/* 
 * File:   main.cpp
 * Author: virtualdemon
 *
 * Created on April 24, 2010, 7:17 PM
 */
#include <vector>
#include <cstdlib>
#include <fstream>
#include <iterator>
#define Nmax 50001

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