Cod sursa(job #1811463)

Utilizator AnaRaduAna-Maria Radu AnaRadu Data 21 noiembrie 2016 11:38:41
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.71 kb
#include <stdio.h>
#include <vector>
#define lim 50005
using namespace std;
std::vector <int> v[lim];
int ord[lim],viz[lim],k;
void dfs(int nod){
    int i,n;
    viz[nod]=1;
    n=v[nod].size();
    for(i=0;i<n;i++)
        if(viz[v[nod][i]]==0)
            dfs(v[nod][i]);
    k++;
    ord[k]=nod;
}
int main(){
    FILE *fin,*fout;
    fin=fopen("sortaret.in","r");
    fout=fopen("sortaret.out","w");
    int i,n,m,x,y;
    fscanf(fin,"%d%d",&n,&m);
    for(i=1;i<=m;i++){
        fscanf(fin,"%d%d",&x,&y);
        v[x].push_back(y);
    }
    for(i=1;i<=n;i++){
        if(viz[i]==0)
            dfs(i);
    }
    for(i=n;i>=1;i--)
        fprintf(fout,"%d ",ord[i]);
    fclose(fin);
    fclose(fout);
    return 0;
}