Cod sursa(job #764248)

Utilizator mi5humihai draghici mi5hu Data 4 iulie 2012 15:53:48
Problema Sortare topologica Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 1.39 kb
#include <stdio.h>
#include <set>
#include <vector>
using namespace std;
   
vector<int> v[50050];
vector<int> rez, tmp_rez;
int n, m;
int gr[50050];
bool vazut[50050] = {false};

void citire() {     
    int a, b;
    scanf("%d%d", &n, &m);
                 
    for (int i = 0; i < m; i++) {
        scanf("%d%d", &a, &b);
        v[a].push_back(b);
        gr[b]++;
    }
}

void elimina(int i) {
     vector<int>::iterator it;
     for (it = v[i].begin(); it != v[i].end(); it++) {
         gr[*it]--;
         if (gr[*it] == 0 && vazut[*it] == false) {
            tmp_rez.push_back(*it);
            vazut[*it] = true;
            elimina(*it);
         }
     }     
     
}

void rezolva() {
     int i, j, el;
     
     for (i = 1; i <= n; i++) {
         if (gr[i] == 0) {
             tmp_rez.push_back(i);
             vazut[i] = true;
         }
     }
                 
     for (i = 1; i <= n; i++) {
         el = tmp_rez.front();         
         tmp_rez.erase(tmp_rez.begin());
         
         rez.push_back(el);
         elimina(el); 
     }     
}

void afisare() {
     while (!rez.empty()) {
           printf("%d ", rez.front());
           rez.erase(rez.begin());
     }     
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    
    citire();
    rezolva();
    afisare();    
}