Cod sursa(job #1427898)

Utilizator PlatonVPlaton Vlad PlatonV Data 3 mai 2015 11:56:18
Problema Sortare topologica Scor 90
Compilator cpp Status done
Runda Arhiva educationala Marime 0.84 kb
#include <stdio.h>
#include <vector>

using namespace std;

int n, m; 
bool viz[50000];
vector<int> g[50000], r;

void citire()
{
    FILE* f = fopen("sortaret.in", "r");

    fscanf(f, "%d%d", &n, &m);

    for (int i = 0; i < m; ++i)
    {
        int x, y;
        fscanf(f, "%d%d", &x, &y);
        g[x].push_back(y);
    }

    fclose(f); 
}

void dfs(int nod)
{
    viz[nod] = true;
    for (int i = 0; i < g[nod].size(); ++i)
        if (!viz[g[nod][i]])
            dfs(g[nod][i]);
    r.push_back(nod);
}

void afisare()
{
    FILE* f = fopen("sortaret.out", "w");

    for (int i = r.size()-1; i >= 0; --i)
        fprintf(f, "%d ", r[i]);

    fclose(f);
}

int main()
{
    citire();

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

    afisare();

    return 0;
}