Cod sursa(job #2667221)
| Utilizator | Data | 3 noiembrie 2020 08:41:06 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.64 kb |
#include <fstream>
#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> v[50005];
bool viz[50005];
int n, m, j, rez[50005];
void dfs(int x){
int i;
viz[x] = 1;
for(i=0; i<v[x].size(); i++)
if(!viz[v[x][i]])
dfs(v[x][i]);
j++;
rez[j] = x;
}
int main()
{
f>>n>>m;
int i, a, b;
for(i=0; i<m; i++){
f>>a>>b;
v[a].push_back(b);
}
for(i=1; i<=n; i++)
if(!viz[i])
dfs(i);
for(int i=n; i>0; i--)
g<<rez[i]<<" ";
return 0;
}