Cod sursa(job #1357186)

Utilizator NacuCristianCristian Nacu NacuCristian Data 23 februarie 2015 20:07:32
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;

vector <int>g[50010];
vector <int>postordine;
int m,n;
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 DSF(int k)
{
    postordine.push_back(k);
    for(int i=0;i<g[k].size();i++)
        if(!viz[g[k][i]])
        {
            viz[g[k][i]]=1;
            DSF(g[k][i]);
        }
}

void rez()
{
    for(int i=1;i<n+1;i++)
        if(!viz[i])
            DSF(i);
    freopen("sortaret.out","w",stdout);
    for(int i=0;i<postordine.size();i++)
        printf("%d ",postordine[i]);
}

int main()
{
    citire();
    rez();
    return 0;
}