PAT 1004 Counting Leaves (30)

1004 Counting Leaves (30)（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

思路：

先建树，然后bfs走一遍，每搜索一层就把叶子统计一下，然后输出叶子数。

代码：

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <cctype>
#include <climits>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <stack>
#include <map>  
#include <set>
using namespace std;

struct node
{
	vector<int> next;
};
vector<node> tree;

void bfs()
{
	queue<int> q;
	q.push(1);
	int size, cnt;
	bool first = true;
	while (!q.empty())
	{
		if (first)
			first = false;
		else
			cout << " ";
		size = q.size();
		cnt = 0;
		while (size--)
		{
			int t = q.front();
			q.pop();
			if (tree[t].next.size() == 0)
				cnt++;
			else
			{
				for (int i = 0; i < tree[t].next.size(); i++)
					q.push(tree[t].next[i]);
			}
		}
		cout << cnt;
	}
}

int main()
{
	int n, m;
	cin >> n >> m;
	tree.resize(n + 1);
	for (int i = 0; i < m; i++)
	{
		int a, b, k;
		cin >> a >> k;
		for (int j = 0; j < k; j++)
		{
			cin >> b;
			tree[a].next.push_back(b);
		}
	}
	bfs();
	return 0;
}