Cod sursa(job #366295)

Utilizator AndreiDDiaconeasa Andrei AndreiD Data 21 noiembrie 2009 14:20:36
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.81 kb
#include <cstdio>
#include <vector>

using namespace std;

#define file_in "sortaret.in"
#define file_out "sortaret.out"


#define Nmax 101000

int a,b,n,m,nr,ord[Nmax],viz[Nmax];
vector<int> v[Nmax];

void dfs(int nod)
{
	int i;
	if (viz[nod])
		return ;
	viz[nod]=1;
	
	for (i=0;i<v[nod].size();++i)
		 if (!viz[v[nod][i]])
			 dfs(v[nod][i]);
		 
	ord[++nr]=nod;
}	

int main()
{
	int i;
	freopen(file_in,"r",stdin);
	freopen(file_out,"w",stdout);
	
	
	scanf("%d %d", &n, &m);
	
	while(m--)
	{
		scanf("%d %d", &a, &b);
		
		v[a].push_back(b);
		//v[b].push_back(a);
	}
	
	nr=0;
	
    memset(viz,0,sizeof(viz));

	for (i=1;i<=n;++i)
		 if (!viz[i])
			 dfs(i);
		 
	for (i=n;i>=1;--i)	 
		 printf("%d ", ord[i]);
	
	fclose(stdin);
	fclose(stdout);
	
	return 0;
	
}