Cod sursa(job #213653)

Utilizator brokensocialiconGrigoriu Cristian-Andrei brokensocialicon Data 10 octombrie 2008 20:09:47
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.89 kb
#include <iostream>
#include <vector>

using namespace std;
int grad[50010],n,m,x,y;
int gint[10000][10000];
int coada[50010];

void citire()
{
    freopen("sortaret.in","r",stdin);
    scanf("%d %d",&n,&m);
    for (int i=1; i<=m; i++)
    {
        scanf("%d %d",&x,&y);
        gint[x][++gint[x][0]]=y;
        grad[y]++;
    }
}

void baga()
{
    for (int i=1; i<=n; i++)
    {
        if (grad[i]==0)
          coada[++coada[0]]=i;
    }

    for (int i=1; i<=n; i++)
    {
        x=coada[i];
        for (int j=1; j<=gint[x][0]; j++)
        {
            grad[gint[x][j]]--;
           if(grad[gint[x][j]]==0)
             coada[++coada[0]]=gint[x][j];
        }
    }
}

int main()
{
    citire();

    baga();
    freopen("sortaret.out","w",stdout);
    for (int i=1; i<=n; i++)
     cout << coada[i] << " ";
    fclose(stdout);
    return 0;
}