Cod sursa(job #1330479)

Utilizator bullseYeIacob Sergiu bullseYe Data 30 ianuarie 2015 18:21:34
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.02 kb
#include <vector>
#include <cstdio>
#define DMAX 50010
using namespace std;
FILE*fout=fopen ("sortaret.out", "w");

int coada[DMAX], n, m, di[DMAX];
vector <int> L[DMAX];

void citire();
void rez();

int main()
{
    citire();
    rez();
    return 0;
}

void citire()
{
    int i, x, y;
    FILE*fin=fopen ("sortaret.in", "r");
    fscanf(fin, "%d %d", &n, &m);
    for (i=1; i<=m; ++i)
    {
        fscanf(fin, "%d %d", &x, &y);
        L[x].push_back (y);
        ++di[y];
    }
    return;
}

void rez()
{
    int i, st=0, dr=0, p;
    //initializez coada
    for (i=1; i<=n; ++i)
        if (!di[i])
    {
        fprintf(fout, "%d ", i);
        coada[++dr]=i;
    }
    while (st<dr)
    {
        p=coada[++st];
        for (i=0; i<L[p].size(); ++i)
        {
            --di[L[p][i]];
            if (!di[L[p][i]])
            {
                fprintf(fout, "%d ", L[p][i]);
                coada[++dr]=L[p][i];
            }
        }
    }
    fclose(fout);
    return;
}