PAT 1094 The Largest Generation (25)

1094 The Largest Generation (25)（25 分）

A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level belong to the same generation. Your task is to find the generation with the largest population.

Input Specification:

Each input file contains one test case. Each case starts with two positive integers N (&lt100) which is the total number of family members in the tree (and hence assume that all the members are numbered from 01 to N), and M (&ltN) which is the number of family members who have children. Then M lines follow, each contains the information of a family member in the following format:

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

where ID is a two-digit number representing a family member, K (&gt0) is the number of his/her children, followed by a sequence of two-digit ID's of his/her children. For the sake of simplicity, let us fix the root ID to be 01. All the numbers in a line are separated by a space.

Output Specification:

For each test case, print in one line the largest population number and the level of the corresponding generation. It is assumed that such a generation is unique, and the root level is defined to be 1.

Sample Input:

23 13
21 1 23
01 4 03 02 04 05
03 3 06 07 08
06 2 12 13
13 1 21
08 2 15 16
02 2 09 10
11 2 19 20
17 1 22
05 1 11
07 1 14
09 1 17
10 1 18

Sample Output:

9 4

 思路：

这题就是个bfs层次遍历，统计完一层的人数后，让他们都出队列，让他们的下一代都入队列，然后重复这个操作。

代码：

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

vector<int> family[100];
int maxn, generation;

void bfs()
{
	queue<int> q;
	int size = 0, level = 1;
	q.push(1);
	while (!q.empty())
	{
		size = q.size();
		if (size>maxn)
		{
			maxn = size;
			generation = level;
		}
		while (size--)
		{
			int root = q.front();
			q.pop();
			for (vector<int>::iterator iter = family[root].begin(); iter != family[root].end(); iter++)
				q.push(*iter);
		}
		level++;
	}
}

int main()
{
	int n, m, father, num, child;
	cin >> n >> m;
	while (m--)
	{
		cin >> father >> num;
		while (num--)
		{
			cin >> child;
			family[father].push_back(child);
		}
	}
	bfs();
	cout << maxn << " " << generation << endl;
	return 0;
}