Cod sursa(job #2258664)
Utilizator | Data | 11 octombrie 2018 19:39:18 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.6 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n, m, x, y, cnt, s[50005], viz[50005];
vector<int> v[50005];
void dfs(int a)
{
viz[a] = 1;
for(int it=0;it<v[a].size();it++)
if(!viz[it])
dfs(it);
s[cnt++] = a;
}
int main()
{
f>>n>>m;
for(;m;m--)
{
f>>x>>y;
v[x].push_back(y);
}
for(int i = 1; i <= n; i++)
if(!viz[i])
dfs(i);
for(int i = n - 1; i >= 0; i--)
g << s[i] << " ";
return 0;
}