Cod sursa(job #213676)

Utilizator EdeNNu Cred EdeN Data 10 octombrie 2008 21:58:57
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.13 kb
#include <stdio.h>
#include <vector>

using namespace std;
int grad[50010],n,m,x,y;
vector <int> ad[50010];
vector <int>::iterator it;
int coada[50010];

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

void create()
{
    int k, aux;
    k=1;
    for (int i=1; i<=n; i++)
        if (grad[i]==0)
            {
                coada[k]=i;
                k++;
            }
    for (int i=1; i<=n; i++)
        {
            aux=coada[i];
            for (it=ad[aux].begin(); it!=ad[aux].end(); it++)
                {
                    grad[*it]--;
                    if (grad[*it]==0)
                        {
                            coada[k]=*it;
                            k++;
                        }
                }
        }
}

void writeit()
{
    freopen("sortaret.out", "w", stdout);
    for (int i=1; i<=n; i++)
        printf("%d", coada[i]);
}

int main()
{
    scanit();
    create();
    writeit();
    return 0;
}