Cod sursa(job #3142119)
| Utilizator | Data | 19 iulie 2023 12:24:39 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.53 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m, i, x, y;
vector<int> a[50002];
bitset<50002> fr;
static inline void parc(int x) {
fr[x] = 1;
for(auto it : a[x]) {
if(!fr[it]) parc(it);
}
fout << x << " ";
}
int main() {
fin >> n >> m;
for(i = 1; i <= m; i++) {
fin >> x >> y;
a[y].push_back(x);
}
for(i = 1; i <= n; i++) {
if(!fr[i]) parc(i);
}
return 0;
}
