Cod sursa(job #411798)

Utilizator jupanubv92Popescu Marius jupanubv92 Data 5 martie 2010 10:15:27
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.75 kb
#include<stdio.h>
#include<vector>
#define Nmx 50005

using namespace std;
int n,m,preordine[Nmx],nr,viz[Nmx];
vector<int> G[Nmx];

void citire()
{
    int x,y;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=m;++i)
    {
        scanf("%d%d",&x,&y);
        G[x].push_back(y);
    }
}

void dfs(int x)
{
    viz[x]=1;
    for(int i=0;i<G[x].size();++i)
        if(!viz[G[x][i]])
            dfs(G[x][i]);
    preordine[++nr]=x;
}

void solve()
{
    for(int i=1;i<=n;++i)
        if(!viz[i])
            dfs(i);
    for(int i=n;i>=1;--i)
        printf("%d ",preordine[i]);
    printf("\n");
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    citire();
    solve();
    return 0;
}