Cod sursa(job #2924127)
| Utilizator | Data | 25 septembrie 2022 22:59:45 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
const int NMAX=5e4+5;
int viz[NMAX];
int rez[NMAX];
int kon;
vector<int>v[NMAX];
void dfs(int x)
{
viz[x]=1;
for(auto i:v[x])
{
if(viz[i]==0)
dfs(i);
}
rez[++kon]=x;
}
int main()
{
int n,m,i,j,x,y;
fin>>n>>m;
for(i=1;i<=m;i++)
{
fin>>x>>y;
v[x].push_back(y);
}
for(i=1;i<=n;i++)
if(viz[i]==0)
dfs(i);
for(i=n;i>=1;i--)
fout<<rez[i]<<" ";
return 0;
}
