Cod sursa(job #1035299)

Utilizator usermeBogdan Cretu userme Data 18 noiembrie 2013 14:38:55
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <cstdio>
#include <vector>

using namespace std;

FILE*f=fopen("sortaret.in","r");
FILE*h=fopen("sortaret.out","w");

vector<int> v[50001];

int n,m,e[50001],p[50001],k;

void dfs(int x){
    p[x]=1;
    for ( int i=0;i<v[x].size();++i ){
        if ( !p[v[x][i]] )dfs(v[x][i]);
    }
    e[++k]=x;
}

int main()
{
    fscanf(f,"%d%d",&n,&m);
    for ( int i=1;i<=m;++i ){
        int a,b;
        fscanf(f,"%d%d",&a,&b);
        v[a].push_back(b);
        e[b]=1;
    }
    for ( int i=1;i<=n;++i )
        if ( e[i]==0&&p[i]==0 ){dfs(i);}
    for ( int i=k;i>=1;--i )
        fprintf(h,"%d ",e[i]);
    return 0;
}