1094 The Largest Generation（25 分）(cj)

最新推荐文章于 2024-04-28 08:30:00 发布

原创最新推荐文章于 2024-04-28 08:30:00 发布 · 161 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

pintia 专栏收录该内容

143 篇文章

订阅专栏

本文介绍了一种通过构建家族成员的树形结构来确定具有最多成员的代际的方法。输入包括家庭成员总数及其子嗣数量，输出为人口最多的代际及其编号。示例展示了如何解析输入并递归地构建每一代成员列表。

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

code

#pragma warning(disable:4996)
#include <iostream>
#include <string>
#include <vector>
using namespace std;
vector<int> people[100];
vector<int> va, vb;
int main() {
	int n, m;
	cin >> n >> m;
	int id, k, x;
	for (int i = 0; i < m; ++i) {
		cin >> id >> k;
		while (k--) {
			cin >> x;
			people[id].push_back(x);
		}
	}
	va.push_back(1);
	int maxnum = 1, level = 1;
	for (int k = 2;; ++k) {
		for (int i = 0; i < va.size(); ++i) {
			for (int j = 0; j < people[va[i]].size(); ++j) {
				vb.push_back(people[va[i]][j]);
			}
		}
		if (vb.size() == 0) break;
		if (maxnum < vb.size()) {
			maxnum = vb.size();
			level = k;
		}
		va = vb;
		vb.clear();
	}
	cout << maxnum << ' ' << level << endl;
	system("pause");
	return 0;
}