1004 Counting Leaves (30分)

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.

Input Specification:

Each input file contains one test case. Each case starts with a line containing 0<N<100, the number of nodes in a tree, and M (<N), the number of non-leaf nodes. Then M lines follow, each in the format:

ID K ID[1] ID[2] ... ID[K]

where ID is a two-digit number representing a given non-leaf node, K is the number of its children, followed by a sequence of two-digit ID's of its children. For the sake of simplicity, let us fix the root ID to be 01.

The input ends with N being 0. That case must NOT be processed.

Output Specification:

For each test case, you are supposed to count those family members who have no child for every seniority level starting from the root. The numbers must be printed in a line, separated by a space, and there must be no extra space at the end of each line.

The sample case represents a tree with only 2 nodes, where 01 is the root and 02 is its only child. Hence on the root 01 level, there is 0 leaf node; and on the next level, there is 1 leaf node. Then we should output 0 1 in a line.

Sample Input:

2 1
01 1 02

Sample Output:

0 1

 

题解：

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> node[110];
int leaf[110] = { 0 }, high = 1;

void DFS(int index, int depth) {
	high = max(depth, high);
	if (node[index].empty())
	{
		leaf[depth]++;
		return;
	}
	for (int i = 0; i < node[index].size(); i++)
		DFS(node[index][i], depth + 1);
}

int main() {
	int n, m, parent, child, k;
	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		cin >> parent >> k;
		for (int j = 0; j < k; j++)
		{
			cin >> child;
			node[parent].push_back(child);
		}
	}

	DFS(1, 1);
	cout << leaf[1];
	for (int i = 2; i <= high; i++)
		cout << ' ' << leaf[i];
        return 0;
}