【PAT甲级】 1094 The Largest Generation

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

使用队列进行层次遍历，得出每个结点的高度，再使用map统计同一层高度的结点的个度

#include <iostream>
#include <vector>
#include <queue>
#include <map>
using namespace std;
struct Node
{
    int index, height;
    Node(int _index, int _height) : index(_index), height(_height) {}
};

int main()
{
    int n, m, x, k, temp;
    cin >> n >> m;
    vector<vector<int> > tree(n + 1);
    for (int i = 0; i < m; i++)
    {
        cin >> x >> k;
        for (int j = 0; j < k; j++)
        {
            cin >> temp;
            tree[x].push_back(temp);
        }
    }
    queue<Node> myQueue;
    vector<Node> myVector;
    myQueue.push(Node(1, 1));
    while (!myQueue.empty())
    {
        Node node = myQueue.front();
        myVector.push_back(node);
        for (int i = 0; i < tree[node.index].size(); i++)
            myQueue.push(Node(tree[node.index][i], node.height + 1));
        myQueue.pop();
    }
    map<int, int> myMap;
    for (auto t : myVector)
        myMap[t.height]++;
    int max = -1;
    for (auto t : myMap)
        if (max < t.second)
            max = t.second;
    printf("%d ", max);
    for (auto t : myMap)
        if (max == t.second)
        {
            printf("%d\n", t.first);
            break;
        }
    return 0;
}