1094. The Largest Generation (25)

原创 2016年05月30日 22:31:35
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.


IDEA

1.树的存储,用的结构vector< vector<int> > tree;

2.树的层序遍历,BFS算法,并且找出每层最大节点数和该层数

3.用到队列,每次外层循环队列大小即为树每层节点数


CODE

#include<iostream>
#include<vector>
#include<queue>
#include<fstream>
using namespace std;

void BFS(vector<vector<int> >&tree,int &max,int &level,int root){
	int gen=level,count;
	queue<int> que;
	que.push(root);
	while(!que.empty()){
		count=que.size();
		if(count>max){
			max=count;
			level=gen;
		}
		while(count--){
			int tmp=que.front();
			que.pop();
			vector<int>::iterator it;
			for(it=tree[tmp].begin();it!=tree[tmp].end();it++){
				//cout<<(*it)<<" ";
				que.push(*it);
			}
		}
		gen++;
	}
	//cout<<endl<<"gen="<<gen<<endl;
}
int main(){
//	freopen("input.txt","r",stdin);
	int n,m;
	cin>>n>>m;	
	
	vector< vector<int> >family;
	family.resize(n+1);

	for(int i=0;i<m;i++){
		int id,k,child;
		cin>>id>>k;
		for(int j=0;j<k;j++){
			cin>>child;
			//family[id][j]=child;	
			family[id].push_back(child);
		}
	}
	int root=1,level=1,max=1;
	BFS(family,max,level,root);
	cout<<max<<" "<<level;
//	fclose(stdin);
	return 0;
}


【LeetCode-面试算法经典-Java实现】【215-Kth Largest Element in an Array(数组中第K大的数)】

【215-Kth Largest Element in an Array(数组中第K大的数)】【LeetCode-面试算法经典-Java实现】【所有题目目录索引】代码下载【https://github...
  • DERRANTCM
  • DERRANTCM
  • 2015年08月28日 06:57
  • 4111

(2016秋数据结构课后练习题总结)03-树2 List Leaves (25分)

Given a tree, you are supposed to list all the leaves in the order of top down, and left to right. ...
  • jiaomenglei
  • jiaomenglei
  • 2016年09月16日 21:26
  • 1106

GAN生成对抗网络发展史-文章整理

2014 GAN 《Generative Adversarial Networks》-Ian Goodfellow, arXiv:1406.2661v1
  • u013369277
  • u013369277
  • 2017年03月09日 09:19
  • 2021

1094. The Largest Generation (25) 此题和六度空间一个道理,记录BFS的层次

1094. The Largest Generation (25) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 Standard 作者...
  • u013167299
  • u013167299
  • 2015年03月14日 21:23
  • 874

1094. The Largest Generation (25)

题目: A family hierarchy is usually presented by a pedigree tree where all the nodes on the same ...
  • Yangsongtao1991
  • Yangsongtao1991
  • 2015年03月16日 11:26
  • 656

PAT 1094. The Largest Generation (25)(bfs遍历)

官网 题目 1094. The Largest Generation (25) 时间限制 200 ms 内存限制 65536 kB 代码长度限制 16000 B 判题程序 St...
  • qq_16949707
  • qq_16949707
  • 2016年10月18日 12:09
  • 131

浙江大学PAT_甲级_1094. The Largest Generation (25)

题目链接:点击打开链接 A family hierarchy is usually presented by a pedigree tree where all the nodes on t...
  • pythontojava
  • pythontojava
  • 2015年11月11日 12:55
  • 412

PAT A 1094. The Largest Generation (25)

题目 A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level...
  • xyzchenzd
  • xyzchenzd
  • 2015年03月19日 18:20
  • 644

【PAT】1094. The Largest Generation (25)

A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level bel...
  • realxuejin
  • realxuejin
  • 2015年10月23日 10:05
  • 407

PAT A1094. The Largest Generation (25)

A family hierarchy is usually presented by a pedigree tree where all the nodes on the same level bel...
  • jolivan
  • jolivan
  • 2017年02月24日 21:52
  • 100
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:1094. The Largest Generation (25)
举报原因:
原因补充:

(最多只允许输入30个字)