Cod sursa(job #1091580)

Utilizator andreea_alexandraAndreea Alexandra andreea_alexandra Data 25 ianuarie 2014 20:38:56
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.85 kb
#include <cstdio>
#include <vector>
using namespace std;
int const MAX_N=50001;
vector<int> graph[MAX_N], stock;
bool viz[MAX_N];
int N, M;

void citire()
{
    int x, y;
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    scanf("%d%d", &N, &M);
    for(int i=0; i<M; i++)
    {
        scanf("%d%d", &x, &y);
        graph[x].push_back(y);
    }
}

void dfs(int x)
{
    viz[x]=true;
    for(vector<int>::iterator it=graph[x].begin(); it!=graph[x].end(); it++)
        if(!viz[*it])
            dfs(*it);
    stock.push_back(x);
}

int main()
{
    citire();
    for(int i=1; i<=N; i++)
        if(!viz[i])
            dfs(i);
    for(vector<int>::reverse_iterator it=stock.rbegin(); it!=stock.rend(); it++)
        printf("%d ", *it);
    fclose(stdin);
    fclose(stdout);
    return 0;
}