#pragma warning(disable:4996)
#include<iostream>
#include<vector>
#include<queue>
using namespace std;
vector<int > vec[110];
int maxchild=0;
int maxchild_temp = 0;
int thelevel=0;
int thelevel_temp = 1;
void bfs(int v) {
queue<int > q;
q.push(v);
int num = q.size();
while (!q.empty()){
int front = q.front();
q.pop();
num = num - 1;
maxchild_temp = maxchild_temp + vec[front].size();
if (maxchild_temp > maxchild) {
maxchild = maxchild_temp;
thelevel = thelevel_temp;
}
for (int i = 0; i < vec[front].size(); i++)
{
q.push(vec[front][i]);
}
if (num <= 0) {
thelevel_temp++;
num = q.size();
maxchild_temp = 0;
}
}
}
int n, m;
int main() {
scanf("%d %d", &n, &m);
if (n == 1) {
cout << 1 << " " << 1;
system("pause");
return 0;
}
for (int i = 0; i < m; i++)
{
int father,k;
scanf("%d %d", &father,&k);
for (int i = 0; i < k; i++)
{
int child;
scanf("%d", &child);
vec[father].push_back(child);
}
}
vec[n + 1].push_back(1);
bfs(n+1);
cout << maxchild << " " << thelevel;
system("pause");
return 0;
}
1094 The Largest Generation (25 分) BFS
©著作权归作者所有,转载或内容合作请联系作者
- 文/潘晓璐 我一进店门，熙熙楼的掌柜王于贵愁眉苦脸地迎上来，“玉大人，你说我怎么就摊上这事。” “怎么了？”我有些...
- 文/花漫 我一把揭开白布。 她就那样静静地躺着，像睡着了一般。 火红的嫁衣衬着肌肤如雪。 梳的纹丝不乱的头发上，一...
- 文/苍兰香墨 我猛地睁开眼，长吁一口气：“原来是场噩梦啊……” “哼！你这毒妇竟也来了？” 一声冷哼从身侧响起，我...
推荐阅读更多精彩内容
- A family hierarchy is usually presented by a pedigree tre...
- 1094 The Largest Generation （25 分） A family hierarchy is ...
- PAT-A 1094，题目地址：https://www.patest.cn/contests/pat-a-prac...
