Cod sursa(job #3303937)
| Utilizator | Data | 19 iulie 2025 12:40:29 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.6 kb |
#include <bits/stdc++.h>
using namespace std;
vector<int> adj[50005];
int ans[50005], poz, viz[50005];
void dfs(int x){
viz[x] = 1;
for(auto i : adj[x]){
if(!viz[i]) dfs(i);
}
ans[poz--] = x;
}
int main(){
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n, m;
cin >> n >> m;
poz = n;
for(int i = 1; i <= m; i++){
int a, b;
cin >> a >> b;
adj[a].push_back(b);
}
for(int i = 1; i <= n; i++){
if(!viz[i]) dfs(i);
}
for(int i = 1; i <= n; i++){
cout << ans[i] << " ";
}
return 0;
}