Cod sursa(job #2254339)

Utilizator remus88Neatu Remus Mihai remus88 Data 5 octombrie 2018 00:35:44
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <bits/stdc++.h>
#define Nmax 100009

using namespace std;

#define USE_FILES 1

#ifdef USE_FILES
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
#define cin fin
#define cout fout
#endif // USE_FILES

int n,m,x,y;
vector<int> G[Nmax],sol;
bitset <Nmax> viz;

void DFS(int node) {

    viz[node]=1;

    for (auto x: G[node])
        if (!viz[x]) DFS(x);

    sol.push_back(node);
}

int main() {

    cin>>n>>m;
    for (int i=1; i<=m; ++i) {

        cin>>x>>y;

        G[x].push_back(y);
        //G[y].push_back(x);
    }

    for (int i=1; i<=n; ++i) {

        if (!viz[i]) {

            DFS(i);
        }
    }

    reverse(sol.begin(),sol.end());
    for (auto x: sol) cout<<x<<' ';

    return 0;
}