Cod sursa(job #2489645)

Utilizator petrisorvmyVamanu Petru Gabriel petrisorvmy Data 9 noiembrie 2019 10:40:40
Problema Sortare topologica Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.77 kb
#include <bits/stdc++.h>
#define NMAX 50009
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector <int> G[NMAX];
int n,m,x,y;
bitset <NMAX> viz;
stack <int> ans;
void DFS(int nod)
{
    for(int i = 0; i < G[nod].size(); ++i)
        if(!viz[ G[nod][i] ])
        {
            viz[ G[nod][i] ] = 1;
            DFS( G[nod][i] );
        }
    ans.push(nod);
}
int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; ++i)
    {
        f >> x >> y;
        G[x].push_back(y);
    }
    for(int i = 1; i <= n; ++i)
        if(!viz[i])
    {
        viz[i] = 1;
        DFS(i);
    }
    while( ans.size() )
    {
        g << ans.top() << ' ';
        ans.pop();
    }
    f.close();
    g.close();
    return 0;
}