Cod sursa(job #325121)

Utilizator mihaionlyMihai Jiplea mihaionly Data 18 iunie 2009 23:02:34
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.59 kb
#include <stdio.h>
#include <vector>
using namespace std;
FILE *f=fopen("sortaret.in","r");
FILE *g=fopen("sortaret.out","w");
#define nmax 50001
vector<int> l[nmax];
int n,p[nmax],k;
bool viz[nmax];
void read()
 {
 int m,x,y;
 fscanf(f,"%d %d",&n,&m);
 for(int i=1;i<=m;i++)
  {
  fscanf(f,"%d %d",&x,&y);
  l[x].push_back(y);
  }
 }
void dfs(int x)
 {
 viz[x]=1;
 for(int i=0;i<l[x].size();i++)
  if(!viz[l[x][i]])
   dfs(l[x][i]);
 p[++k]=x;
 }
int main()
 {
 read();
 for(int i=1;i<=n;i++)
  if(!viz[i])
   dfs(i);
 for(int i=n;i>0;i--)
  fprintf(g,"%d ",p[i]);
 }