1094 The Largest Generation （25 分）

最新推荐文章于 2024-06-02 16:33:44 发布

xiaoshengMr

最新推荐文章于 2024-06-02 16:33:44 发布

阅读量532

点赞数 1

CC 4.0 BY-SA版权

分类专栏： PAT甲级(Advanced Level) 文章标签： PAT ACM

本文链接：https://blog.youkuaiyun.com/w_x_s_h_h/article/details/88072826

PAT甲级(Advanced Level) 专栏收录该内容

36 篇文章

订阅专栏

本文介绍了一种算法，用于解决在给定的家族树结构中找出人口最多的世代的问题。通过深度优先搜索（DFS）遍历家族树，并使用哈希表记录每个世代的成员数量，从而确定人口最多的世代及其具体人数。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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

思路：求树中的一层，孩子数最多，用dfs深搜，然后用hashtable 记录每一层的节点数，关键点在这里，每一次dfs就需要进行一次记录，故需要把hasht 放在dfs的入口处

#include<bits/stdc++.h>
#define ll long long
using namespace std;
const int maxn=110;
vector<int> tree[maxn];
int n,m,hasht[maxn]={0},maxc=0;
void dfs(int root, int depth)
{
    hasht[depth]++;
    if(tree[root].size()==0) {
        return ;
    }
    for(int i=0;i<tree[root].size();i++)
    {
        dfs(tree[root][i],depth+1);
    }
}
int main()
{
    cin>>n>>m;
    int id,k,tmp;
    for(int i=0;i<m;i++)
    {
        cin>>id>>k;
        for(int i=0;i<k;i++)
        {
            cin>>tmp;
            tree[id].push_back(tmp);
        }
    }
    dfs(1,1);
    int cnt=0;
    for(int i=0;i<maxn;i++)
    {
        if(hasht[i]>maxc)
        {
            cnt=i;
            maxc=hasht[i];
        }
    }
    //cout<<hasht[1]<<endl;
    cout<<maxc<<" "<<cnt<<endl;
    return 0;
}