Cod sursa(job #905721)

Utilizator yAur7Stoian Cosmin yAur7 Data 6 martie 2013 08:49:28
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.92 kb
#include <iostream>
#include <vector>
 
using namespace std;
int grad[50010],n,m,x,y;
vector <int> gint[50010];
vector <int>::iterator it;
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].push_back(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 (it=gint[x].begin(); it!=gint[x].end(); it++)
        {
            grad[*it]--;
           if(grad[*it]==0)
             coada[++coada[0]]=*it;
        }
    }
}
 
int main()
{
    citire();
 
    baga();
    freopen("sortaret.out","w",stdout);
    for (int i=1; i<=n; i++)
     cout << coada[i] << " ";
    fclose(stdout);
    return 0;
}