Cod sursa(job #2455618)
Utilizator | Data | 12 septembrie 2019 09:27:52 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.54 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int n,m;
bool ap[50005];
vector<int> lista[50005];
void dfs(int node)
{
ap[node]=1;
for(auto x:lista[node])
{
if(!ap[x])
dfs(x);
}
out << node << ' ';
}
int main()
{
in >> n >> m;
for(int i=1; i<=m; i++)
{
int x,y;
in >> x >> y;
lista[y].push_back(x);
}
for(int i=1; i<=n; i++)
if(!ap[i])
dfs(i);
return 0;
}