Cod sursa(job #1679281)

Utilizator razvandRazvan Dumitru razvand Data 7 aprilie 2016 20:29:56
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <iostream>
#include <fstream>
#include <vector>
#include <bitset>
#include <stack>
#define MAX 50003

using namespace std;

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

vector<int> vec[MAX];
bitset<MAX> viz;
stack<int> st;

void dfs(int nod) {

    if(viz[nod] || nod == 0)
        return;

    viz[nod] = 1;

    for(vector<int>::iterator it = vec[nod].begin(); it != vec[nod].end(); it++)
        dfs(*it);

    st.push(nod);

}

int main() {

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

    int n,m,a,b;
    in >> n >> m;

    for(int i = 0; i < m; i++) {
        in >> a >> b;
        vec[a].push_back(b);
    }

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

    while(!st.empty()) {
        out << st.top() << " ";
        st.pop();
    }

    return 0;
}