Cod sursa(job #2195586)

Utilizator vlad_schillerSchiller Vlad Radu vlad_schiller Data 16 aprilie 2018 19:39:26
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <iostream>
#include <fstream>
#include <stack>
#include <vector>
#define maxu 50005
using namespace std;
int n,m,s,viz[maxu];
stack < int > q;
vector < int > g[maxu];

void citire()
{
    int x, y;
    ifstream f("sortaret.in");
    f>>n>>m;
    for(int i=0; i<m; i++)
    {
        f>>x>>y;
        g[x].push_back(y);
    }
}

void dfs(int x)
{
    viz[x]=1;
    for (auto &v:g[x])
    {
        if (viz[v]==0)
            dfs(v);
    }
    q.push(x);
}

int main()
{
    ofstream g("sortaret.out");
    citire();
    for(int i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
    while(!q.empty())
    {
        g<<q.top()<<' ';
        q.pop();
    }
    return 0;
}