Cod sursa(job #2079736)

Utilizator pistvanPeter Istvan pistvan Data 1 decembrie 2017 19:16:32
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <fstream>
#include <vector>
#define MaxN 50005
using namespace std;

int N, M, x, y;
vector<int> G[MaxN];
int t[MaxN], j=0;
int viz[MaxN];
void Read()
{
    ifstream f("sortaret.in");
    f>>N>>M;
    for (int i=1;i<=N;i++)
        G[i].push_back(0);
    for (int i=0;i<M;i++)
    {
        f>>x>>y;
        G[x].push_back(y);
        G[x][0]++;
    }
}

void DFS(int x)
{
    viz[x]=1;
    for (int i=1;i<=G[x][0];i++)
        if (!viz[G[x][i]]) DFS(G[x][i]);
    t[j++]=x;
}

void Write()
{
    ofstream g("sortaret.out");
    for (int i=N-1;i>=0;i--)
        g<<t[i]<<' ';
}

int main()
{
    Read();
    for (int i=1;i<=N;i++)
        if (!viz[i]) DFS(i);
    Write();
}