Cod sursa(job #1741989)

Utilizator flaviu_2001Craciun Ioan-Flaviu flaviu_2001 Data 15 august 2016 16:34:15
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <cstdio>
#include <vector>
#define MAX 50005

using namespace std;

vector<int> v[MAX], r;
int n, m;
bool vs[MAX];

void read();
void dfs(int x);
void write();

int main()
{
    read();
    for (int i = 1; i <= n; ++i)
        if (!vs[i])
            dfs(i);
    write();
    return 0;
}

void read(){
    freopen ("sortaret.in", "r", stdin);
    scanf ("%d%d", &n, &m);
    while(m--){
        int x, y;
        scanf ("%d%d", &x, &y);
        v[x].push_back(y);
    }
    fclose(stdin);
}

void dfs(int x){
    vs[x] = 1;
    for (unsigned int i = 0; i < v[x].size(); ++i){
        if (!vs[v[x][i]])
            dfs(v[x][i]);
    }
    r.push_back(x);
}

void write(){
    freopen ("sortaret.out", "w", stdout);
    for (int i = r.size()-1; i; --i)
        printf ("%d ", r[i]);
    fclose(stdout);
}