1094 The Largest Generation (25 point(s)) PAT甲级

最新推荐文章于 2022-02-25 17:33:09 发布

柴郡猫的耳朵尖

最新推荐文章于 2022-02-25 17:33:09 发布

阅读量68

点赞数

分类专栏： PAT刷题笔记文章标签：数据结构 dfs

本文链接：https://blog.csdn.net/weixin_43996404/article/details/115817286

版权

PAT刷题笔记专栏收录该内容

29 篇文章 0 订阅

订阅专栏

1094 The Largest Generation (25 point(s))

DFS

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

思路

题意

给出m行家庭信息，每行信息包含一个id和这个id的子女们，根据给出的信息构建家族树，求出最大人数的一代，输出人数和世代数（假设01是祖代）

分析

用vector类数组vector v[105]构建树，用DFS遍历树，每层的人数用数组pop记录，途径该分支的时候pop[level]++即可。

然后遍历一遍pop数组就可以求出最大人数和世代了。

代码

#include<iostream>
#include<vector>
using namespace std;

vector<int> v[105];
int pop[105] = { 0 };

void dfs(int i, int level){
	pop[level]++;
	for (int j = 0; j < v[i].size(); ++j) {
		dfs(v[i][j], level + 1);
	}
}

int main()
{
	int n, m, k, id, child, maxp = 0, gen;
	scanf("%d%d", &n, &m);
	for (int i = 0; i < m; ++i) {
		scanf("%d%d", &id, &k);
		for (int j = 1; j <= k; ++j) {
			scanf("%d", &child);
			v[id].push_back(child);
		}
	}
	dfs(1, 1);
	for (int i = 0; i < 105; ++i) {
		if (pop[i] > maxp) {
			maxp = pop[i];
			gen = i;
		}
	}
	printf("%d %d\n", pop[gen], gen);
	return 0;
}