Cod sursa(job #1877852)

Utilizator gabib97Gabriel Boroghina gabib97 Data 13 februarie 2017 19:13:13
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.65 kb
#include <stdio.h>
#include <vector>
using namespace std;

int n,m,i,x,y,postord[50005],nr;
bool o[50005];
vector<int> G[50005];

void DFS(int s)
{
    int i,z=G[s].size();
    o[s]=1;
    for (i=0;i<z;i++)
        if (!o[G[s][i]])
            DFS(G[s][i]);
    postord[++nr]=s;
}

int main()
{
    freopen ("sortaret.in","r",stdin);
    freopen ("sortaret.out","w",stdout);
    scanf("%i%i",&n,&m);
    for (i=1;i<=m;i++)
    {
        scanf("%i%i",&x,&y);
        G[x].push_back(y);
    }
    for (i=1;i<=n;i++)
        if (!o[i])
            DFS(i);
    for (i=nr;i>=1;i--)
        printf("%i ",postord[i]);
    fclose(stdin);
    fclose(stdout);
    return 0;
}