Cod sursa(job #850847)

Utilizator Coman95coman cosmin Coman95 Data 9 ianuarie 2013 00:22:26
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <fstream>
#include <vector>
using namespace std;

#define NMAX 50001

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m, k;
int deg[NMAX], Q[NMAX];
vector<int> G[NMAX];

int main()
{
    int a, b;
    fin >> n >> m;
    for( int i = 1; i <= m; ++i )
    {
        fin >> a >> b;
        G[a].push_back( b );
        deg[b]++;
    }

    for( int i = 1; i <= n; ++i )
        if( deg[i] == 0 )
            Q[++k] = i;

    for( int i = 1; i <= n; ++i )
    {
        a = Q[i];
        for( vector<int>::iterator it = G[a].begin(); it != G[a].end(); ++it )
        {
            deg[*it]--;
            if( deg[*it] == 0 )
                Q[++k] = *it;
        }
    }

    for( int i = 1; i <= n; ++i )
        fout << Q[i] << ' ';

    fin.close();
    fout.close();
    return 0;
}