Cod sursa(job #999349)

Utilizator manutrutaEmanuel Truta manutruta Data 19 septembrie 2013 23:16:55
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.98 kb
# include <iostream>
# include <fstream>
# include <vector>
# include <bitset>
using namespace std;

# define MAXN 50010
# define MAXM 100010
typedef vector<int> :: iterator iter;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n, m;
vector<int> G[MAXN];
bitset<MAXN> viznod;
vector<int> coada;

void tpsort(int nod)
{
    //cout << nod << ' ';
    for (iter it = G[nod].begin(); it != G[nod].end(); it++) {
        if (viznod[*it] == false) {
            viznod[*it] = true;
            tpsort(*it);
        }
    }

    coada.push_back(nod);
}

int main()
{
    f >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y;
        f >> x >> y;
        G[x].push_back(y);
    }

    for (int i = 1; i <= n; i++) {
        if (viznod[i] == false) {
            viznod[i] = true;
            tpsort(i);
        }
    }

    for (iter it = coada.end() - 1; it != coada.begin() - 1; it--) {
        g << *it << ' ';
    }

    return 0;
}