Cod sursa(job #3270886)
| Utilizator | Data | 24 ianuarie 2025 19:35:30 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.63 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector <int> v[50005];
int c[50005];
int viz[50005];
int cnt;
void f(int x)
{
viz[x] = 1;
for(auto it : v[x])
if(viz[it] == 0)
f(it);
c[cnt] = x;
cnt ++;
}
int main()
{
int n, m;
in >> n >> m;
for(int i = 1; i <= m; i ++)
{
int a, b;
in >> a >> b;
v[a].push_back(b);
}
for(int i = 1; i <= n; i ++)
if(viz[i] == 0)
f(i);
for(int i = cnt - 1; i >= 0; i --)
out << c[i] << " ";
return 0;
}
