1094 The Largest Generation-PAT甲级

 

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

两种方法进行遍历bfs与dfs

bfs代码如下：

#include<bits/stdc++.h>
using namespace std;
const int N=110;
vector<int>ve[N];
int n,m;
queue<int>q; 
int level[N],levelSum[N];//节点所处的层数，某一层中节点的个数 
void bfs(){
	q.push(1);
	while(!q.empty()){
		int p=q.front();
		q.pop();
		levelSum[level[p]]++;
		for(int i=0;i<ve[p].size();i++){
			level[ve[p][i]]=level[p]+1;
			q.push(ve[p][i]);
		}
	}
}
int main(){
	memset(level,0,sizeof(level));
	memset(levelSum,0,sizeof(levelSum));
	scanf("%d%d",&n,&m);
	int id,k,son;
	for(int i=0;i<m;i++){
		scanf("%d%d",&id,&k);
		for(int j=1;j<=k;j++){
			scanf("%d",&son);
			ve[id].push_back(son);
		}
	}
    level[1]=1;
    bfs();
//c++标准库自带的求一个序列中最大元素的函数，
//并返回一个迭代器
	int i=max_element(levelSum+1,levelSum+n+1)-levelSum;
	printf("%d %d\n",levelSum[i],i);
	return 0;
	
}

dfs代码如下：

#include<bits/stdc++.h>
using namespace std;
const int N=110;
vector<int>ve[N];
int n,m;
int level[N],levelSum[N];//节点所处的层数，某一层中节点的个数 
void dfs(int p){
	for(int i=0;i<ve[p].size();i++){
		level[ve[p][i]]=level[p]+1;
		levelSum[level[ve[p][i]]]++;
		dfs(ve[p][i]);
	}
}
int main(){
	memset(level,0,sizeof(level));
	memset(levelSum,0,sizeof(levelSum));
	scanf("%d%d",&n,&m);
	int id,k,son;
	for(int i=0;i<m;i++){
		scanf("%d%d",&id,&k);
		for(int j=1;j<=k;j++){
			scanf("%d",&son);
			ve[id].push_back(son);
		}
	}
    level[1]=1;
    levelSum[1]=1;
    dfs(1);
//c++标准库自带的求一个序列中最大元素的函数，
//并返回一个迭代器
	int i=max_element(levelSum+1,levelSum+n+1)-levelSum;
	printf("%d %d\n",levelSum[i],i);
	return 0;
	
}