Cod sursa(job #797288)

Utilizator TeodoraTanaseTeodora Tanase TeodoraTanase Data 13 octombrie 2012 18:28:02
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.04 kb
#include <cstdio>
#include <vector>

#define NMAX 50001

using namespace std;

FILE *inFile = fopen ("sortaret.in", "r");
FILE *outFile = fopen ("sortaret.out", "w");

vector <int> G[NMAX];
vector <int> L;

int n;
bool viz[NMAX];

void read()
{
    int m;
    int x;
    int y;

    fscanf (inFile, "%d %d\n", &n, &m);

    while (m --)
    {
        fscanf (inFile, "%d %d\n", &x, &y);
        G[x].push_back(y);
    }
}

void dfs(int i)
{
    for (unsigned int j = 0; j < G[i].size(); ++ j)
    {
        int v = G[i][j];

        if (!viz[v])
        {
            viz[v] = 1;
            dfs(v);
        }
    }

    L.push_back(i);
}

void sort()
{
    for (int i = 1; i <= n; ++ i)
        if (!viz[i])
        {
            viz[i] = 1;
            dfs(i);
        }
}

void print()
{
    while (!L.empty())
    {
        fprintf (outFile, "%d ", L.back());
        L.pop_back();
    }

    fprintf (outFile, "\n");
}

int main()
{
    read();
    sort();
    print();

    return 0;
}