Cod sursa(job #764263)

Utilizator mi5humihai draghici mi5hu Data 4 iulie 2012 16:41:53
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.19 kb
#include <stdio.h>
#include <set>
#include <vector>
using namespace std;
   
vector<int> v[50050];
int rez[50050];
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 bfs(int i) {
     vector<int>::iterator it;
     for (it = v[i].begin(); it != v[i].end(); it++) {
         gr[*it]--;
         if (gr[*it] == 0) {
            rez[0]++;
            rez[rez[0]] = *it;            
         }
     }     
     
}

void rezolva() {
     int i, j, el_cur;
     
     for (i = 1; i <= n; i++) {
         if (gr[i] == 0) {
             rez[0]++;
             rez[rez[0]] = i;   
         }
     }
     
     for (i = 1; i <= n; i++) {
         el_cur = rez[i];         
         bfs(el_cur);
     }
}

void afisare() {
     for (int i = 1; i <= n; i++) {
           printf("%d ", rez[i]);
     }     
}

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