Cod sursa(job #2175092)
Utilizator | Dumitrescu Andrei dumitrescu_andrei | Data | 16 martie 2018 15:15:07 |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.57 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,ordine[50005],nr;
vector <int> V[50005];
int viz[50005];
void DFS(int x)
{
viz[x]=1;
for(auto &it:V[x])
if(!viz[it])
DFS(it);
ordine[++nr]=x;
}
int main()
{
f>>n>>m;
for(int i=1;i<=m;++i)
{
int x,y;
f>>x>>y;
V[x].push_back(y);
}
for(int i=1;i<=n;++i)
if(!viz[i])
DFS(i);
for(int i=n;i>=1;--i)
g<<ordine[i]<<" ";
return 0;
}