Cod sursa(job #145735)

Utilizator bogdanhm999Casu-Pop Bogdan bogdanhm999 Data 29 februarie 2008 12:03:24
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.78 kb
#include <stdio.h>
#include <vector>
#include <bitset>
#define nMax 50001
#define mMax 100001

using namespace std;

long n,m,i,x,y,q;
long postordine[nMax];
vector <unsigned int>v[mMax];
bitset <65536>viz;

void DFS(int x){
     int i;
     viz[x]=1;
     for (i=0;i<v[x].size();i++)
         if (!viz[v[x][i]])
            DFS(v[x][i]);
     postordine[++q]=x;
}

int main(){
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    
    scanf("%ld %ld",&n,&m);
    
    for (i=1;i<=m;i++){
        scanf("%ld %ld",&x,&y);
        v[x].push_back(y);
    }
    
    for (i=1;i<=n;i++)
        if (!viz[i])
           DFS(i);
    
    for (i=n;i;i--)
        printf("%ld ",postordine[i]);
    printf("\n");

return 0;
}