1094 The Largest Generation (25 分)

最新推荐文章于 2024-10-14 17:54:02 发布

是六六呀yhy521

最新推荐文章于 2024-10-14 17:54:02 发布

阅读量178

点赞数

本文链接：https://blog.csdn.net/fairylyt/article/details/123157881

版权

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

61 篇文章 0 订阅

订阅专栏

这段代码实现了一个用广度优先搜索（BFS）解决家族树中查找最大人口数的世代问题。输入是家族成员数量和有孩子的家庭成员信息，输出是最大人口数及其所在的世代。程序首先读取输入，构建家族树，并通过BFS遍历找到最大人口的世代。

摘要由CSDN通过智能技术生成

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

代码：

#include<iostream>
#include<queue>
#include<vector>
using namespace std;
struct node
{
    vector<int > child;
    int level;
}Node[110];
int N,M,MAX_level=1,k,maxp=0,nowp=0,nowl=-1;
void BFS(int root)
{
    queue<int > Q;
    Q.push(root);
    Node[root].level=1;
    while(!Q.empty())
    {
        int temp=Q.front();
        Q.pop();
        if(Node[temp].level==nowl)
            nowp++;
        else
        {
            if(nowp>maxp)
            {
                maxp=nowp;
                MAX_level=nowl;
            }
            nowl=Node[temp].level;
            nowp=1;
        }
        for(int i=0;i<Node[temp].child.size();i++)
        {
            Node[Node[temp].child[i]].level=Node[temp].level+1;
            Q.push(Node[temp].child[i]);
        }
    }
    if(nowp>maxp)
    {
        maxp=nowp;
        MAX_level=nowl;
    }
}
int main()
{
    int K,ID;
    scanf("%d%d",&N,&M);
    if(N==1&&M==0)
    {
        printf("1 1");
        return 0;
    }
    for(int i=1;i<=M;i++)
    {
        scanf("%d%d",&ID,&K);
        for(int j=0;j<K;j++)
        {
            int temp;
            scanf("%d",&temp);
            Node[ID].child.push_back(temp);
        }
    }
    BFS(1);
    printf("%d %d",maxp,MAX_level);
    return 0;
}