Cod sursa(job #954770)

Utilizator SovStoStoicescu Mihail Cristian SovSto Data 29 mai 2013 23:43:48
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.91 kb
#include <iostream>
#include<vector>
#include<fstream>

#define maxn 50073

using namespace std;

vector <int> v[maxn];
int viz[maxn];
int c[maxn];


int main()
{

    register int i,count=1;
    int n,m,x,y;

    ifstream f("sortaret.in");
    ofstream g("sortaret.out");

    f>>n>>m;

    for (i=1; i<=m; ++i)
    {
        f>>x>>y;
        v[x].push_back(y);
        ++viz[y];
    }

    for (i=1; i<=n; ++i)
        if (!viz[i])
        {
            c[count]=i;
            count++;
        }

    for (i=1; i<=n; i++)
    {
        int nod=c[i];

        for (unsigned int j=0; j<v[nod].size(); ++j)
        {
            int next=v[nod][j];
            --viz[next];

            if (!viz[next])
            {
                c[count]=next;
                count++;
            }
        }
    }

    for (i=1; i<=n; ++i)
        g<<c[i]<<" ";

    return 0;
}