Cod sursa(job #1005095)

Utilizator Eby7Elena Obreja Eby7 Data 4 octombrie 2013 09:26:58
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include<fstream>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
vector<int> a[50010];
int n,m,x,y,use[50010],k=0,o[50010];
void read()
{
    f>>n>>m;
    for(int i=1;i<=n;i++)
    {
        f>>x>>y;
        a[y].push_back(x);
    }
}
void DFS(int nod)
{
    use[nod]=1;
    for(unsigned int i=0;i<a[nod].size();i++)
     if(!use[a[nod][i]])
      DFS(a[nod][i]);
    o[++k]=nod;
}
void write()
{
    for(int i=1;i<=k;i++)
     g<<o[i]<<" ";
}
int main()
{
    read();
    for(int i=1;i<=n;i++)
     if(!use[i])
      DFS(i);
    write();
    return 0;
}