Cod sursa(job #1593064)

Utilizator AcuasPopescu Nicolae-Aurelian Acuas Data 8 februarie 2016 11:39:35
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.93 kb
#include <cstdio>
#define NMAX 50005
using namespace std;
struct nod{
    int info;
    nod *next;
};
struct nod *v[NMAX],*h;
int t,n,m,viz[NMAX];
nod* push(nod* p,int x){
    nod* elem=new nod;
    elem->info=x;
    elem->next=p;
    return elem;
}
void DFS(int x){
    if(viz[x]==0){
        viz[x]=++t;
        nod* parcurg=v[x];
        while(parcurg){
            DFS(parcurg->info);
            parcurg=parcurg->next;
        }
        h=push(h,x);
    }
}
void citire(){
    scanf("%d%d",&n,&m);
    int i,j,k;
    for(k=m;k>=1;k--){
        scanf("%d%d",&i,&j);
        v[i]=push(v[i],j);
    }
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    citire();
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
            DFS(i);
    nod* parcurg=h;
    while(parcurg){
        printf("%d ",parcurg->info);
        parcurg=parcurg->next;
    }
    return 0;
}