Cod sursa(job #1804078)

Utilizator andreigasparoviciAndrei Gasparovici andreigasparovici Data 12 noiembrie 2016 10:52:54
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.8 kb
#include <iostream>
#include <cstdio>
#include <vector>
#include <stack>
using namespace std;

int n,m,viz[50001];
vector<int>graf[50001];

void citire()
{
    scanf("%d %d ",&n,&m);
    for(;m--;)
    {
        int a,b;
        scanf("%d %d",&a,&b);
        graf[a].push_back(b);
    }
}

stack<int>stiva;

void dfs(int i)
{
    viz[i]=1;
    for(int j=0;j<graf[i].size();j++)
    {
        if(!viz[graf[i][j]])
            dfs(graf[i][j]);

    }
    stiva.push(i);
}

void sortare()
{

    for(int i=1;i<=n;i++)
    {
        if(!viz[i])
        {
            dfs(i);
        }
    }
    while(!stiva.empty())
    {
        printf("%d ",stiva.top());
        stiva.pop();
    }
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);

    citire();
    sortare();
    return 0;
}