首页 > 试题广场 >

The Largest Generation (25)

[编程题]The Largest Generation (25)

热度指数：5480 时间限制：C/C++ 1秒，其他语言2秒空间限制：C/C++ 64M，其他语言128M
算法知识视频讲解

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.

输入描述:

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.

输出描述:

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.

示例1

输入

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

输出

9 4

算法知识视频讲解

Java

FrankPhilosopher

import java.util.Scanner;
import java.util.Queue;
import java.util.LinkedList;
public class A1005
{
    private static int M, N;
    private static int[][] familyTree;// 看成有向图 用邻接矩阵存储
    private static Queue<Integer> childQueue;
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        N = sc.nextInt();
        M = sc.nextInt();
        familyTree = new int[N + 1][N + 1];// 从01开始，所以大小为N+1，弃去一行一列
        childQueue = new LinkedList<>();
        for (int i = 0; i < M; i++)
        {
            int v = sc.nextInt();
            int numOfChild = sc.nextInt();
            for (int j = 0; j < numOfChild; j++)
            {
                int child = sc.nextInt();
                familyTree[v][child] = 1;
            }
        }
        sc.close();
        int result = 1;
        int resLevel = 1;
        childQueue.add(1);
        int numOfChild = 1;
        for (int level = 1; !childQueue.isEmpty(); level++)
        {
            int index = numOfChild;
            numOfChild = 0;
            for (int i = 0; i < index; i++)
            {
                int child = childQueue.poll();
                for (int j = 1; j < N + 1; j++)
                {
                    if (familyTree[child][j] == 1)
                    {
                        childQueue.add(j);
                        numOfChild++;
                    }
                }
            }
            if(numOfChild>result)
            {
                result = numOfChild;
                resLevel = level+1;
            }
        }
        System.out.print(result+" "+resLevel);
    }
}

发表于 2019-01-26 22:05:10 回复(0)