Cod sursa(job #2863876)
| Utilizator | Data | 7 martie 2022 12:47:53 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int>v[50100],vsort;
bool viz[50100];
int x, y, n, m;
void dfs(int x)
{
viz[x]=1;
for(auto it:v[x])
if(!viz[it])
dfs(it);
vsort.push_back(x);
}
int main() {
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back(y);
}
for(int i=1;i<=n;i++)
if(!viz[i])
dfs(i);
for(auto it = vsort.rbegin(); it!=vsort.rend(); it++)
fout<<*it<<' ';
return 0;
}
