Cod sursa(job #1555392)

Utilizator Burbon13Burbon13 Burbon13 Data 22 decembrie 2015 18:48:20
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <cstdio>
#include <vector>
#include <bitset>
using namespace std;

const int nmx = 50002;

int n,m;
vector <int> g[nmx],r;
bitset <nmx> viz;

void citire(){
    scanf("%d %d", &n, &m);
    int nod1,nod2;
    for(int i = 1; i <= m; ++i){
        scanf("%d %d", &nod1, &nod2);
        g[nod1].push_back(nod2);
    }
}

void parcurgere(int nod){
    viz[nod] = true;
    r.push_back(nod);
    for(vector<int>::iterator it = g[nod].begin(); it != g[nod].end(); ++it)
       if(not viz[*it])
        parcurgere(*it);
}

int main(){
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    citire();
    for(int i = 1; i <= n; ++i)
        if(not viz[i])
            parcurgere(i);
    for(vector<int>::iterator it = r.begin(); it != r.end(); ++it)
        printf("%d ", *it);
    return 0;
}