Cod sursa(job #1733461)

Utilizator remus88Neatu Remus Mihai remus88 Data 24 iulie 2016 18:54:35
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <fstream>
#include <vector>
#include <bitset>
#define Nmax 50009

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n,m,nr,x,y,sol[Nmax];
bitset <Nmax> viz;
vector <int> G[Nmax];

void DFS(int node)
{
    viz[node]=1;
    for (vector <int>::iterator it=G[node].begin(); it!=G[node].end(); ++it)
    if (!viz[*it])
    {
            DFS(*it);

    }
    ++nr;
    sol[nr]=node;
}

int main()
{
    f>>n>>m;
    for (int i=1; i<=m; ++i)
    {
        f>>x>>y;
        G[x].push_back(y);
    }
    for (int i=1; i<=n; ++i)
        if (!viz[i]) DFS(i);
    for (int i=nr; i>=1; --i) g<<sol[i]<<' ';
    f.close();
    g.close();
    return 0;
}