Cod sursa(job #1110078)

Utilizator Alexghita96Ghita Alexandru Alexghita96 Data 17 februarie 2014 20:15:15
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.82 kb
#include <cstdio>
#include <vector>

#define Nmax 50005

using namespace std;

int N, M, Viz[Nmax], D[Nmax], nr;
vector <int> G[Nmax];

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 nod)
{
    vector <int> :: iterator it;
    Viz[nod] = 1;
    for (it = G[nod].begin(); it != G[nod].end(); ++it)
        if (!Viz[*it])
            DFS(*it);
    D[++nr] = nod;
}

void Afisare()
{
    for (int i = nr; i >= 1; --i)
        printf("%d ", D[i]);
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    Citire();
    for (int i = 1; i <= N; ++i)
        if (!Viz[i])
            DFS(i);
    Afisare();

    return 0;
}