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<queue>
#include<map>
using namespace std;
struct node
{
	int level;
	vector<int>child;
};
vector<node>v(100);
int book[100] = { 0 };
queue<int>q;
int main()
{
	int n, m,root=1,maxdepth=0;
	scanf("%d %d", &n, &m);
	for (int i = 0; i < m; i++)
	{
		int id, cnt, tmp;
		scanf("%d %d", &id, &cnt);
		for (int j = 0; j < cnt; j++)
		{
			scanf("%d", &tmp);
			v[id].child.push_back(tmp);
		}
	}
	q.push(root);
	v[root].level = 0;
	while (q.size())
	{
		int t = q.front();
		q.pop();
		if (v[t].child.size() == 0) book[v[t].level]++;
		if (v[t].level > maxdepth) maxdepth = v[t].level;
		for (int i = 0; i < v[t].child.size(); i++)
		{
			v[v[t].child[i]].level = v[t].level + 1;
			q.push(v[t].child[i]);
		}
	}
	printf("%d", book[0]);
	for (int i = 1; i <= maxdepth; i++)
	{
		printf(" %d", book[i]);
	}
	return 0;
}

后记

老套路，再加一个数组就好了。QWQ