Cod sursa(job #3195116)

Utilizator vlad_binVlad Bintintan vlad_bin Data 20 ianuarie 2024 09:46:45
Problema Sortare topologica Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.71 kb
#include <fstream>
#include <stack>
#include <vector>
#include <deque>
#include <bitset>

using namespace std;

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

vector<int> G[50005];
int rezz[50005];
int ind = 0;
bitset<50005> vzt_dfs;

void dfs(int nod) {
    vzt_dfs[nod] = true;
    for (auto it : G[nod])
        if (vzt_dfs[it] == false)
            dfs(it);
    rezz[ind++] = nod;
}

int main() {
    int n, m;
    in >> n >> m;
    for (int i = 0; i < m; i++) {
        int a, b;
        in >> a >> b;
        G[a].push_back(b);
    }
    for (int i = 1; i <= n; i++) {
        if (vzt_dfs[i] == false)
            dfs(i);
    }
    for (--ind; ind >= 0; ind--)
    {
        out << rezz[ind] << '\n';
    }
}