Mai intai trebuie sa te autentifici.
Cod sursa(job #1645109)
| Utilizator | Data | 10 martie 2016 11:05:43 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.62 kb |
#include <fstream>
#include <vector>
using namespace std;
vector<int> L[50005];
vector<int> ans;
bool viz[50005];
void df(int v) {
viz[v] = true;
for(int i = 0; i < L[v].size(); i ++)
if(!viz[L[v][i]]) df(L[v][i]);
ans.push_back(v);
}
int main()
{
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m, x, y;
f >> n >> m;
for(; m; m --) {
f >> x >> y;
L[x].push_back(y);
}
for(int i = 1; i <= n; i ++)
if(!viz[i]) df(i);
for(int i = ans.size() - 1; i >= 0; i --) g << ans[i] << " ";
g << "\n";
return 0;
}
