Cod sursa(job #1194756)

Utilizator LurchssLaurentiu Duma Lurchss Data 4 iunie 2014 18:57:49
Problema Sortare topologica Scor 10
Compilator cpp Status done
Runda Arhiva educationala Marime 0.76 kb
#include <iostream>
#include <fstream>
#include <stack>
#include <vector>

#define max 50001
using namespace std;
int n,m;
vector <int> g[max];
int viz[max];
stack <int> s;
void citire()
{
    scanf("%d %d",&n,&m);
    for(int i=1;i<=m;i++)
    {
        int x,y;
        scanf("%d %d",&x,&y);
        g[x].push_back(y);
    }
}
void dfs(int x)
{
    for(vector <int>::iterator it=g[x].begin();it!=g[x].end();it++)
        dfs(*it);
    s.push(x);
    viz[x]=1;
}
int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    citire();
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
        dfs(i);
    while(!s.empty())
    {
        printf("%d ",s.top());
        s.pop();
    }
    return 0;
}