Cod sursa(job #410352)

Utilizator robertzelXXX XXX robertzel Data 4 martie 2010 11:58:28
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <iostream>
#include <vector>
#define MAX_N 50010
#define MAX_M 100010

using namespace std;

vector<int> a[MAX_M];
int rez[MAX_N];
int viz[MAX_N];
int nr=-1,n,m;

void citire () {
    int i,x,y;

    scanf("%d %d", &n, &m);

    for (i=0; i<m; i++) {
        scanf("%d %d", &x, &y);
        a[x].push_back(y);
    }
}

void dfs (int x) {
    int i;
    viz[x] = 1;

    for (i=0; i<a[x].size(); i++) {
        if (!viz[a[x][i]]) {
            dfs(a[x][i]);
        }
    }

    rez[++nr]=x;
}

void afisare () {
    int i;

    for (i=0; i<n; i++) {
        printf("%d ", rez[i]);
    }
}

int main()
{
    int i;

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

    citire();

    for (i=1; i<=n; i++) {
        if (!viz[i]) {
            dfs(i);
        }
    }

    reverse(rez, rez+n);

    afisare();

    return 0;
}