Mai intai trebuie sa te autentifici.
Cod sursa(job #2214508)
Utilizator | Data | 19 iunie 2018 11:49:46 | |
---|---|---|---|
Problema | Sortare topologica | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.67 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector <int> v[50001];
int sel[50001],of[50001],nr;
void df(int x)
{
int i;
sel[x]=1;
for (i=0;i<v[x].size();i++)
{
if (sel[v[x][i]]==0)
{
df(v[x][i]);
}
}
of[++nr]=x;
}
int i,x,y;
int main()
{
int n,m;
f>>n>>m;
for (i=1;i<=m;i++)
{
f>>x>>y;
v[x].push_back(y);
}
for (i=1;i<=n;i++)
{
if (sel[i]==0)
{
df(i);
}
}
for (int i=nr;i>=1;i--)
{
g<<of[i]<<" ";
}
return 0;
}