Cod sursa(job #2030106)

Utilizator osiaccrCristian Osiac osiaccr Data 1 octombrie 2017 09:20:44
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.87 kb
#include <fstream>
#include <vector>
#define DEF 50001

using namespace std;

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

vector <int> N[DEF], sol;

int n, m;
bool viz[DEF];

void add_arc (int x, int y) {
    for (int i = 0; i < N[x].size (); i++) {
        if (N[x][i] == y)
            return;
    }
    N[x].push_back (y);
}

void dfs (int nod) {
    viz [nod] = 1;
    for (int i = 0; i < N[nod].size (); i++) {
        if (viz [N[nod][i]] == 0)
            dfs (N[nod][i]);
    }
    sol.push_back (nod);
}

int main () {
    fin >> n >> m;
    for (int i = 1; i <= n; i++) {
        int x, y;
        fin >> x >> y;
        add_arc (x, y);
    }

    for (int i = 1; i <= n; i++)
        if (viz[i] == 0)
            dfs (i);

    for (int i = sol.size () - 1; i >= 0; i--)
        fout << sol[i] << " ";

    return 0;
}