Cod sursa(job #2722306)

Utilizator KPP17Popescu Paul KPP17 Data 12 martie 2021 18:44:22
Problema Sortare topologica Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.47 kb
#include <fstream>
#define mF "sortaret"
std::ifstream in(mF ".in");
std::ofstream out(mF ".out");
constexpr int N = 50001; int V[N], l;
#include <vector>
std::vector<int> L[N];
#include <bitset>
std::bitset<N> E;
void DFS(int t) {for (int f: L[t]) DFS(f); E[V[l++] = t] = true;}
int main() {int n, m; in >> n >> m; while (m--) {int a, b; in >> a >> b; L[a].push_back(b);}
for (int i = 1; i <= n; i++) if (not E[i]) DFS(i); for (int i = n; i--;) out << V[i] << ' ';}