Cod sursa(job #1093427)
Utilizator | FMI Cornoiu Vlad vladutz15 | Data | 27 ianuarie 2014 23:24:03 |
---|---|---|---|
Problema | Sortare topologica | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m,i,viz[50002],sol[50001],val,x,y;
vector <int> v[50001];
void sortdfs(int i)
{
int j;
viz[i]=1;
for (j=0;j<v[i].size();j++)
if (!viz[v[i][j]]) sortdfs(v[i][j]);
sol[++val]=i;
}
int main ()
{
cin>>n>>m;
for (i=1;i<=n;i++)
{
cin>>x>>y;
v[x].push_back(y);
}
for (i=1;i<=n;i++)
if (!viz[i]) sortdfs(i);
for (i=n;i>=1;i--)
cout<<sol[i]<<" ";
}