Cod sursa(job #1036738)

Utilizator Alexghita96Ghita Alexandru Alexghita96 Data 19 noiembrie 2013 16:31:22
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.97 kb
#include <cstdio>
#include <vector>

#define Nmax 50001

using namespace std;

int N, M, D[Nmax], Q[Nmax], LQ, Nr[Nmax];
vector <int> G[Nmax];

void Citire()
{
    int a, b;
    scanf("%d %d", &N, &M);
    for (int i = 1; i <= M; ++i)
    {
        scanf("%d %d", &a, &b);
        G[a].push_back(b);
        D[b]++;
        Nr[a]++;
    }
    for (int i = 1; i <= N; ++i)
        if (!D[i])
            Q[++LQ] = i;
}

void Cautare(int nod)
{
    for (int i = 0; i < Nr[nod]; ++i)
    {
        if (D[G[nod][i]])
            D[G[nod][i]]--;
        if (!D[G[nod][i]])
        {
            Q[++LQ] = G[nod][i];
            D[G[nod][i]] = -1;
        }
    }
}

void Afisare()
{
    for (int i = 1; i <= LQ; ++i)
        printf("%d ", Q[i]);
}

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

    Citire();
    for (int i = 1; i <= N; ++i)
        Cautare(i);
    Afisare();

    return 0;
}