Cod sursa(job #2501844)

Utilizator Mirela_MagdalenaCatrina Mirela Mirela_Magdalena Data 30 noiembrie 2019 11:40:01
Problema Sortare topologica Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.8 kb
#define NMAX 50005
#include <cstdio>
#include <vector>
#include <stack>
using namespace std;

int n, m;
int viz[NMAX];
vector<int> graph[NMAX];
stack<int> Q;


void read()
{
    int x, y;

    freopen("sortaret.in", "r", stdin);
    scanf("%d %d", &n, &m);

    for(int i=0; i<m; ++i)
    {
        scanf("%d %d", &x, &y);
        graph[x].push_back(y);
    }

}


void start(int i)
{
    viz[i] = 1;
    for(auto &v:graph[i])
        if(viz[v] == 0)
            start(v);
    Q.push(i);

}

void afis()
{
    freopen("sortaret.out", "w", stdout);
    while(!Q.empty())
    {
        printf("%d ", Q.top());
        Q.pop();
    }
}



int main()
{
    read();
    for(int i=1; i<=n; ++i)
        if(viz[i] == 0)
            start(i);
    afis();
    return 0;
}