【PAT】A1094. The Largest Generation (25)

Author: CHEN, Yue

Organization: 浙江大学

Time Limit: 200 ms

Memory Limit: 64 MB

Code Size Limit: 16 KB

A1094. 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

//NKW 甲级真题1005
#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
const int maxn = 110;
int n, m, id, childnum, childid, maxnum[maxn], level = 0;
vector<int> vi[maxn];
void tri(int index,int level){
	maxnum[level + 1] += vi[index].size();
	for (int i = 0; i < vi[index].size(); i++){
		tri(vi[index][i], level + 1);
	}
}
int main(){
	scanf("%d %d", &n, &m);
	for (int i = 0; i < m; i++){
		scanf("%d %d", &id, &childnum);
		for (int j = 0; j < childnum; j++){
			scanf("%d", &childid);
			vi[id].push_back(childid);
		}
	}
	tri(1, 1);
	maxnum[1] = 1;    // 第一层只有根节点
	for (int i = 0; i < maxn; i++){
		if (maxnum[i] > maxnum[0]){
			level = i;                // 更宽层层号
			maxnum[0] = maxnum[i];    // 更宽层人数
		}
	}
	printf("%d %d\n", maxnum[0], level);
	return 0;
}

Analysis

-已知一棵树的结点总数和非叶子结点总数。

-求这棵树中最宽的一层的结点数和层号。