Mai intai trebuie sa te autentifici.
Cod sursa(job #1955006)
| Utilizator | Data | 5 aprilie 2017 19:34:17 | |
|---|---|---|---|
| Problema | Sortare topologica | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.59 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m, i, x, y;
vector<int>ls[50005];
bool viz[50005];
int stiva[50005], vf;
void dfs(int x) {
int l = ls[x].size(), i, y;
viz[x]=1;
for (i = 0; i < l; i++) {
y = ls[x][i];
if (viz[y]==0)dfs(y);
}
stiva[++vf] = x;
}
int main() {
f >> n >> m;
for (i = 1; i <= m; i++) {
f >> x >> y;
ls[x].push_back(y);
}
dfs(1);
for (i=vf;i;i--)
g << stiva[i] << ' ';
return 0;
}
