Cod sursa(job #1856400)

Utilizator silkMarin Dragos silk Data 24 ianuarie 2017 20:12:14
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.72 kb
#include <cstdio>
#include <vector>
#define NMax 50000
using namespace std;

vector<int> a[NMax+1];
char deja[NMax+1];
int ord[NMax+1];
int N,M,T;

void DFS(int x)
{
    int i,y;

    deja[x] = 1;
    for(i = 0; i < a[x].size(); ++i)
    {
        y = a[x][i];
        if(!deja[y]) DFS(y);
    }
    ord[++T] = x;
}

int main(){
    FILE* fin = fopen("sortaret.in","r");
    FILE* fout = fopen("sortaret.out","w");

    int i,x,y;

    fscanf(fin,"%d %d",&N,&M);
    for(i = 1; i <= M; ++i)
    {
        fscanf(fin,"%d %d",&x,&y);
        a[x].push_back(y);
    }

    for(i = 1; i <= N; ++i)
    if(!deja[i]) DFS(i);

    for(i = N; i >= 1; --i) fprintf(fout,"%d ",ord[i]);


return 0;
}