Cod sursa(job #2168472)

Utilizator DanielRusuDaniel Rusu DanielRusu Data 14 martie 2018 11:08:18
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;

vector <vector <int> > G;
vector <int> deg, Q;

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

    int N, M;
    scanf("%d %d\n", &N, &M);
    deg.resize(N + 2);
    Q.resize(N + 2);
    G.resize(N + 2);
    for(int i = 1; i <= M; ++i) {
        int x, y;

        scanf("%d %d\n", &x, &y);

        G[x].push_back(y);
        deg[y]++;
    }

    while(Q[0] < N) {
        for(int i = 1; i <= N; ++i) {
            if(deg[i] == 0) {
                Q[++Q[0]] = i;

                for(auto nxt: G[i]) {
                    deg[nxt]--;
                }
            }
        }
    }

    for(int i = 1; i <= N; ++i) {
        cout << Q[i] << ' ';
    }

    cout << '\n';

    return 0;
}