Cod sursa(job #1026895)

Utilizator KheyasVettor Stefan-Andrei Kheyas Data 12 noiembrie 2013 09:52:54
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

int n,m, g[50010], k, a[50010];
vector<int> V[50010];

int main()
{
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");

    fin >> n >> m;

    //CITIRE
    int x, y;
    for(;m;m--)
    {
        fin >> x >> y;
        V[x].push_back(y);
        g[y]++;
    }

    //PARCURGERE
    for(int i = 1;i <= n;i++)
    {
        if(g[i] == 0)
            a[++k] = i;
    }

    for(int j = 1; j <= n; j++)
    {
        for(vector<int>::iterator it = V[a[j]].begin(); it != V[a[j]].end(); it++)
        {
            g[*it]--;
            if(g[*it]==0)
                a[++k] = *it;
        }
    }

    for(int i = 1; i<=n; i++)
    {
        fout << a[i] << " ";
    }

    return 0;
}