E - Genealogical tree

题目

$Description$
The system of Martians’ blood relations is confusing enough. Actually, Martians bud when they want and where they want. They gather together in different groups, so that a Martian can have one parent as well as ten. Nobody will be surprised by a hundred of children. Martians have got used to this and their style of life seems to them natural.
And in the Planetary Council the confusing genealogical system leads to some embarrassment. There meet the worthiest of Martians, and therefore in order to offend nobody in all of the discussions it is used first to give the floor to the old Martians, than to the younger ones and only than to the most young childless assessors. However, the maintenance of this order really is not a trivial task. Not always Martian knows all of his parents (and there’s nothing to tell about his grandparents!). But if by a mistake first speak a grandson and only than his young appearing great-grandfather, this is a real scandal.
Your task is to write a program, which would define once and for all, an order that would guarantee that every member of the Council takes the floor earlier than each of his descendants.
$Input$
The first line of the standard input contains an only number N, 1 <= N <= 100 — a number of members of the Martian Planetary Council. According to the centuries-old tradition members of the Council are enumerated with the natural numbers from 1 up to N. Further, there are exactly N lines, moreover, the I-th line contains a list of I-th member’s children. The list of children is a sequence of serial numbers of children in a arbitrary order separated by spaces. The list of children may be empty. The list (even if it is empty) ends with 0.
$Output$
The standard output should contain in its only line a sequence of speakers’ numbers, separated by spaces. If several sequences satisfy the conditions of the problem, you are to write to the standard output any of them. At least one such sequence always exists.

$翻译$
火星人的血缘关系系统已经够混乱的了。事实上，火星人在他们想要的时间和地点发芽。它们以不同的形式聚集在一起，所以一个火星人可以有一个父母，也可以有十个。没有人会对一百个孩子感到惊讶。火星人已经习惯了这一点，他们的生活方式对他们来说似乎很自然。
在行星会议上，混乱的系谱系统导致了一些尴尬。那里有最优秀的火星人，因此在所有的讨论中，为了不冒犯任何人，通常先让年长的火星人发言，再让不是很年轻的火星人，最后是给最年轻的没有子女的评估者发言。然而，维护这个顺序确实不是一项简单的任务。火星人并不总是了解他的父母(没有什么可以告诉他的祖父母!)如果出现了孙子在其年轻的曾祖父面前发言的情况，这是一个真正的丑闻。
你的任务是写一个程序，它将一劳永逸地定义一个秩序，保证理事会的每个成员都比他的后代更早发言。

import java.util.Arrays;
import java.util.LinkedList;
import java.util.Queue;
import java.util.Scanner;

public class Main{
	/*
	 * [7.20~7.26] 图的基本应用
	 * E - Genealogical tree
	 * 拓扑排序
	 */
	static int n,m,M=110,x,y;
	static int indegree[],money[],g[][],output[];
	static int num,sum;
	static final int MAX_VALUE=Integer.MAX_VALUE;
	static String s[];
	
	public static void main(String []args) {
		Scanner sc=new Scanner(System.in);
		g=new int [M][M];
		indegree=new int [M];
		output=new int [M];
		while(sc.hasNext()) {
			n=sc.nextInt();
			reinit();
			sc.nextLine();
			for(int i=1;i<=n;i++) {
				s=sc.nextLine().split(" ");
				for(int j=0;j<s.length-1;j++) {
					x=Integer.parseInt(s[j]);
					if(g[i][x]==0) {
						g[i][x]=1;
						indegree[x]++;
					}
				}
			}
			tuopu();
		}
	}
	static void tuopu() {
		int cnt=0;
		int i,j;
		for(i=1;i<=n;i++) {
			if(indegree[i]==0) {
				break;
			}
		}
		while(true) {
			j=1;
			if(indegree[j]!=0) {
				while(true) {
					j++;
					if(indegree[j]==0||j>n) break;
				}
			}
			indegree[j]=-1;
			output[cnt]=j;
			cnt++;
			if(cnt==n) break;
			for(i=1;i<=n;i++) {
				if(g[j][i]>0) {
					indegree[i]--;
					g[j][i]=-1;
				}
			}
		}
		for(i=0;i<cnt-1;i++) System.out.print(output[i]+" ");
		System.out.println(output[cnt-1]);
	}
	static void reinit() {
		for(int i=0;i<=n;i++) Arrays.fill(g[i], 0);
		Arrays.fill(indegree, 0);
	}
}
/*
5
0
4 5 1 0
1 0
5 3 0
3 0

YES
NO
 */