Cod sursa(job #2715181)

Utilizator NorbiNORBI KOVER Norbi Data 3 martie 2021 10:16:00
Problema Sortare topologica Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.93 kb
#include <cstdio>
#include <vector>
using namespace std;
FILE *f=fopen("sortaret.in","r");
FILE *g=fopen("sortaret.out","w");

const int NMAX = 50005;
const int MMAX = 100005;

vector<int> Muchii[NMAX];
int Sortat[50001];
int nrSort;
int n,m;
bool viz[NMAX];
void read()
{
    int x,y;
    fscanf(f,"%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        fscanf(f,"%d%d",&x,&y);
        Muchii[x].push_back(y);
    }

}
void DFS(int nodCurent)
{
    viz[nodCurent] = 1;
    for(int i =0;i<Muchii[nodCurent].size();i++)
    {
        int vecin=Muchii[nodCurent][i];
        if(!viz[vecin])
        {
            DFS(vecin);
        }
    }
    Sortat[++nrSort]=nodCurent;
}

int main()
{
    read();
    int x,y,i;
    for(i=1; i<=n; i++)
    {
        if(!viz[i])
            DFS(i);
    }
    for(i=nrSort;i>=1;i--)
        fprintf(g,"%d ",Sortat[i]);

    fclose(f);
    fclose(g);
    return 0;
}