Cod sursa(job #364654)

Utilizator RegeleUmbrelorPopescu Mihai RegeleUmbrelor Data 16 noiembrie 2009 18:36:45
Problema Sortare topologica Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 0.62 kb
#include<stdio.h>
#include<vector>
using namespace std;
const int N=50001,M=100001;
vector<int> a[N];
bool viz[N];
int v[N], nr=0,n,m;
void citire()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	int x,y;
	scanf("%d%d",&n,&m);
	while(m--)
	{
		scanf("%d%d", &x,&y);
		a[x].push_back(y);
	}
}
void dfs(int x)
{
	viz[x]=true;
	for(int i=0;i<a[x].size();i++)
		if(!viz[a[x][i]])
			dfs(a[x][i]);
	v[++nr]=x;
}

void afisare()
{
	while(nr)
		printf("%d ", v[nr--]);
}

int main()
{
	citire();
	for(int i=1;i<=n;++i)
		if(!viz[i])
			dfs(i);
	afisare();
	return 0;
}