Cod sursa(job #1653738)

Utilizator llalexandruLungu Alexandru Ioan llalexandru Data 16 martie 2016 15:31:35
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.96 kb
#include <fstream>
#include <stdlib.h>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int *A[50005], i, n, m, x, y;

int Stiva[50005], nr, Valid[50005];

void DFS(int x)
{
    int i, p;
    for (i=1; i<=A[x][0]; i++)
    {
        p=A[x][i];
        if (Valid[p]==0)
        {
            Valid[p]=1;
            Stiva[++nr]=p;
            DFS(p);
        }
    }
}

int main()
{
    fin>>n>>m;
    for (i=1; i<=n; i++)
    {
        A[i] = (int *) realloc(A[i], sizeof(int));
        A[i][0]=0;
    }
    for (i=1; i<=m; i++)
    {
        fin>>x>>y;
        A[x][0]++;
        A[x] = (int *) realloc(A[x],(A[x][0]+1)*sizeof(int));
        A[x][A[x][0]]=y;
    }
    for (i=1; i<=n; i++)
    {
        if (Valid[i]==0)
        {
            Valid[i]=1;
            Stiva[++nr]=i;
            DFS(i);
        }
    }
    for (i=1; i<=n; i++)
        fout<<Stiva[i]<<" ";
    return 0;
}