Cod sursa(job #347533)

Utilizator rumburakrumburak rumburak Data 12 septembrie 2009 17:31:26
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.61 kb
#include<cstdio>
#include<vector>

using namespace std;

const int N = (1<<16);

int n,nrp[N],vf;
vector<int> a[N];
bool viz[N];

void citire()
{
	int m,x,y;
	scanf("%d%d",&n,&m);
	while(m--)
	{
		scanf("%d%d",&x,&y);
		a[x].push_back(y);
		++nrp[y];
	}
}

void dfs(int x)
{
	printf("%d ",x);
	viz[x]=true;
	for(int i=0,m=a[x].size() ; i<m ; ++i)
	{
		--nrp[a[x][i]];
		if(nrp[a[x][i]] == 0)
			dfs(a[x][i]);
	}
}

int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	citire();
	for(int i=1 ; i<=n ; ++i)
		if(!viz[i])
			dfs(i);
	return 0;
}