Cod sursa(job #1575613)

Utilizator serbanSlincu Serban serban Data 21 ianuarie 2016 17:57:10
Problema Sortare topologica Scor 60
Compilator cpp Status done
Runda Arhiva educationala Marime 0.98 kb
#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

vector<int> still;
vector<int> ans;
vector<int> L[50100];
int c[50100];

int main()
{
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");

    int n, m, x, y;
    f >> n >> m;
    for(int i = 1; i <= n; i ++) still.push_back(i);
    for(int i = 1; i <= m; i ++) {
        f >> x >> y;
        c[y] ++;
        L[x].push_back(y);
    }

    int ies = 1, poz;
    while(ies) {
        ies = 0; poz = -1;
        for(int i = 0; i < still.size(); i ++) {
            if(c[still[i]] == 0) poz = i;
        }
        if(poz < 0) break;
        ies = still[poz];
        for(int i = 0; i < L[ies].size(); i ++) {
            c[L[ies][i]] --;
        }
        ans.push_back(ies);
        c[ies] = -1;
        still[poz] = still[still.size() - 1];
        still.pop_back();
    }
    for(int i = 0; i < ans.size(); i ++) g << ans[i] << " ";
    g << "\n";
    return 0;
}