Cod sursa(job #2647376)

Utilizator pregoliStana Andrei pregoli Data 4 septembrie 2020 10:48:27
Problema Sortare topologica Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.74 kb
#include <bits/stdc++.h>
#define newline '\n'
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
///***********************
const int NMAX = 5e4 + 3;
int n, m, cn, ans[NMAX];
vector<int> graph[NMAX];
bool vis[NMAX];

void dfs(int node) {
    vis[node] = true;
    for (auto it : graph[node])
        if (!vis[it])
            dfs(it);
    ans[cn--] = node;
}

int main() {
    fin >> n >> m;
    for (int i = 0, a, b; i < m; i++) {
        fin >> a >> b;
        graph[a].push_back(b);
    }
    cn = n;
    for (int i = 1; i <= n; i++)
        if (!vis[i])
            dfs(i);
    for (int i = 1; i <= n; i++)
        fout << ans[i] << ' ';
    fout << newline;
    fout.close();
    return 0;
}