PAT A 1094. The Largest Generation (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 (<100) 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 (<N) 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 (>0) 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 <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <deque>
using namespace std;

struct test_point	//探测用结构
{
	int id,gen;		//id,代数
	test_point(int i=0,int g=0):id(i),gen(g){}
};

int main()
{
	int n,m;
	cin>>n>>m;

	vector<vector<int>> child(n+1);	//相应id的孩子
	int k,id;
	for(int i=0;i<m;i++)
	{
		cin>>id>>k;
		for(int j=0;j<k;j++)
		{
			child[id].push_back(0);
			cin>>child[id].back();
		}
	}

	deque<test_point> queue(1,test_point(1,1));	//队列
	test_point tp1,tp2;
	int max=1,max_gen=1,gen=0;	//最大代的人数，相应的代数，当前统计的代数
	while(!queue.empty())	//bfs
	{
		if(queue.front().gen>gen)
		{
			gen=queue.front().gen;
			if(queue.size()>max)
			{
				max=queue.size();
				max_gen=queue.front().gen;
			}
		}
		tp1=queue.front();
		queue.pop_front();
		for(int i=0;i<child[tp1.id].size();i++)
		{
			tp2.id=child[tp1.id][i];
			tp2.gen=tp1.gen+1;
			queue.push_back(tp2);
		}
	}

	cout<<max<<" "<<max_gen;

	return 0;
}