1094. The Largest Generation (25)（bfs）

1094. The Largest Generation (25)

时间限制

200 ms

内存限制

65536 kB

代码长度限制

16000 B

判题程序

Standard

作者

CHEN, Yue

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

bfs层序遍历

code：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <queue>
#include <vector>
#include <algorithm>
using namespace std;
int n,m;
vector<int>G[110];
int vis[110];
struct node{
    int level;
    int id;
}s,nexts;
struct generation{
    int num;
    int level;
}g[110];
void bfs(){
    queue<node>q;
    vis[1] = 1;
    s.level = 1;
    s.id = 1;
    g[1].num = 1;
    q.push(s);
    while(!q.empty()){
        s = q.front();
        q.pop();
        for(int i = 0; i < G[s.id].size(); i++){
            if(!vis[G[s.id][i]]){
                vis[G[s.id][i]] = 1;
                nexts.id = G[s.id][i];
                nexts.level = s.level + 1;
                g[nexts.level].num++;
                q.push(nexts);
            }
        }
    }
}
bool cmp(generation a,generation b){
    return a.num > b.num;
}
int main(){
    int i,j;
    for(i = 0; i < 110; i++){
        g[i].level = i;
        g[i].num = 0;
    }
    cin >> n >> m;
    for(i = 0; i < m; i++){
        int id,k,son;
        cin >> id >> k;
        for(j = 0; j < k; j++){
            cin >> son;
            G[id].push_back(son);
        }
    }
    memset(vis,0,sizeof(vis));
    bfs();
    sort(g+1,g+1+n,cmp);
    cout << g[1].num << " " << g[1].level << endl;
    return 0;
}