Cod sursa(job #3261642)
| Utilizator | Data | 7 decembrie 2024 09:53:29 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,a,b,cnt,v[50005],f[50005];
vector<int>G[50005];
void dfs(int acc)
{
f[acc]=1;
for(auto e:G[acc])
if(f[e]==0)
dfs(e);
v[++cnt]=acc;
}
int main()
{
fin>>n>>m;
for(int i=1;i<=m;i++)
{
fin>>a>>b;
G[a].push_back(b);
}
for(int i=1;i<=n;i++)
if(f[i]==0)
dfs(i);
for(int i=cnt;i>=1;i--)
fout<<v[i]<<' ';
return 0;
}
