Cod sursa(job #1128250)

Utilizator bogdanrusRus Bogdan bogdanrus Data 27 februarie 2014 16:15:59
Problema Sortare topologica Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 0.64 kb
#include <cstdio>
#include <cstring>
#include <vector>
using namespace std;

#define NMax 50100

int M, N, viz[NMax], deg[NMax];  vector<int> G[NMax];

void sortare (void) {	
	int i, j, k;
	
	for(i = 1; i<=N; i++) 
	{
		for(j = 1; j<=N; j++) 
			if(!viz[j] && deg[j] == 0) 
			{
				viz[j]=1;  printf("%d ",i);
				for (k=0; k<G[i].size(); ++k) 
					deg[G[j][k]]--;
				break;
			}
	}
}


int main (void) {
	
	int i,a,b;
		
    freopen("sortaret.in", "rt", stdin);
    freopen("sortaret.out", "wt", stdout);
	
    scanf("%d %d\n", &N, &M);
    for(i = 1; i <= M; i++)
        scanf("%d %d", &a, &b), G[a].push_back(b), deg[b]++;
		
	sortare();

return 0;
}