A1094. 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

DFS解法：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cmath>
using namespace std;

vector<int> ID[100];
int num[100];
void DFS(int index, int depth) {
    num[depth]++;
    if(ID[index].size() == 0)
        return ;
    for(int i = 0; i < ID[index].size(); i++)
        DFS(ID[index][i], depth+1);
}
int main() {
	freopen("data.in","r",stdin);
    int n, m, a, k, id,temp;
    scanf("%d %d", &n, &m);
    for(int i1 = 0; i1 < m; i1++) {
        scanf("%d %d",&id, &k);
        for(int j = 0; j < k; j++) {
            scanf("%d", &temp);
            ID[id].push_back(temp);
        }
    }
   DFS(1, 1);
    int maxnum = 0, maxlevel = 1;
    for(int i = 1; i < 100; i++) {
        if(num[i] > maxnum) {
            maxnum = num[i];
            maxlevel = i;
        }
    }
    printf("%d %d", maxnum, maxlevel);
    return 0;
}

BFS实现：

#include<cstdio>
#include<iostream>
#include<cstring>
#include<algorithm>
#include<vector>
#include<queue>
#include<cmath>
using namespace std;

vector<int> ID[110];
int num[110]={0};//记录每个层有几个点
int level[110];//记录每个点在几层
void BFS(int root)
{
	queue<int> q;
	q.push(root);
	level[1]=1;
	while(!q.empty())
	{
		int index=q.front();
		q.pop();
		num[level[index]]++;//当前节点所在层的节点数增加
		for(int i=0;i<ID[index].size();i++) //要注意，我错在用q.size()了，应该是遍历其每个孩子
		{	//下一层，孩子~
			level[ID[index][i]]=level[index]+1;
			q.push(ID[index][i]);
		}
	}
}
int main()
{
	freopen("data.in","r",stdin);
	int n,m;
	int id,k,temp;
	scanf("%d %d",&n,&m);
	for(int i1=0;i1<m;i1++)
	{
		scanf("%d %d",&id,&k);
		for(int j=0;j<k;j++)
		{	scanf("%d",&temp);
			ID[id].push_back(temp);
		}
	}
		BFS(1);
		int max=0,l=1;
	for(int ii=1;ii<=100;ii++)
	{
		if(max<num[ii])
		{	max=num[ii];
			l=ii;
		}
	}
	printf("%d %d",max,l);
		
		return 0;
}