Cod sursa(job #1494482)

Utilizator NacuCristianCristian Nacu NacuCristian Data 1 octombrie 2015 10:34:06
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.9 kb
#include <iostream>
#include <stdio.h>
#include <vector>
using namespace std;

vector <int> g[50010];
vector <int> postordine;

int n,m;

void citire()
{
    freopen("sortaret.in","r",stdin);
    scanf("%d %d",&n,&m);
    for(int i=0; i<m; i++)
    {
        int a,b;
        scanf("%d %d",&a,&b);
        g[a].push_back(b);
    }
}

int viz[50010];

void DFS(int k)
{
    for(int i=0; i<g[k].size(); i++)
    {
        if(!viz[g[k][i]])
        {
            viz[g[k][i]]=1;
            DFS(g[k][i]);
        }
    }
    postordine.push_back(k);
}

void afisare()
{
    freopen("sortaret.out","w",stdout);
    for(int i=postordine.size()-1;i>=0;i--)
        printf("%d ", postordine[i]);
}


int main()
{
    citire();
    for(int i=1; i<=n; i++)
        if(!viz[i])
        {
            viz[i]=1;
            DFS(i);
        }
    afisare();


    return 0;
}