1004 Counting Leaves (30分)

A family hierarchy is usually presented by a pedigree tree. Your job is to count those family members who have no child.

Input Specification:

Each input file contains one test case. Each case starts with a line containing 0<N<100, the number of nodes in a tree, and M (<N), the number of non-leaf nodes. Then M lines follow, each in the format:

ID K ID[1] ID[2] ... ID[K]

where ID is a two-digit number representing a given non-leaf node, K is the number of its children, followed by a sequence of two-digit ID's of its children. For the sake of simplicity, let us fix the root ID to be 01.

The input ends with N being 0. That case must NOT be processed.

Output Specification:

For each test case, you are supposed to count those family members who have no child for every seniority level starting from the root. The numbers must be printed in a line, separated by a space, and there must be no extra space at the end of each line.

The sample case represents a tree with only 2 nodes, where 01 is the root and 02 is its only child. Hence on the root 01 level, there is 0 leaf node; and on the next level, there is 1 leaf node. Then we should output 0 1 in a line.

Sample Input:

2 1
01 1 02

Sample Output:

0 1

 大意：给出n为树中点的总数，m为非叶子节点数目，问每层叶子结点的数目。

一刷： dfs：

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

vector<int> input[100];
int cnt[100], maxdepth = -1;

void dfs(int index, int depth)
{
	if (input[index].size() == 0)
	{
		cnt[depth]++;
		maxdepth = max(maxdepth, depth);
		return;
	}
	int size = input[index].size();
	for (int i = 0; i < size; i++)
	{
		dfs(input[index][i], depth + 1);
	}
}

int main()
{
	//freopen("in.txt", "r", stdin);
	int n, m;

	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		int node, k, c;
		cin >> node >> k;
		for (int j = 0; j < k; j++)
		{
			cin >> c;
			input[node].push_back(c);
		}
	}
	dfs(1, 0);
	cout << cnt[0];
	for (int i = 1; i <= maxdepth; i++)
	{
		cout << " " << cnt[i];
	}
	return 0;
}

 BFS吾:

#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

vector<int> input[100];
int cnt[100], maxdepth = -1;

void dfs(int index, int depth)//深度优先搜索
{
	if (input[index].size() == 0)
	{
		cnt[depth]++;
		maxdepth = max(maxdepth, depth);
		return;
	}
	int size = input[index].size();
	for (int i = 0; i < size; i++)
	{
		dfs(input[index][i], depth + 1);
	}
}

void bfs(int index, int depth)//广度优先搜索or层序遍历
{
	vector<int> v;
	maxdepth = max(depth, maxdepth);
	int size = input[index].size();
	if (v.size() == 0)
	{
		if (input[index].size() == 0)
		{
			cnt[depth]++;
		}
		else
		{
			for (int j = 0; j < size; j++)
			{
				v.push_back(input[index][j]);
			}
		}
	}

	for (int i = 0; i < v.size(); i++)
	{
		bfs(v[i], depth + 1);
	}


}

int main()
{
	//freopen("in.txt", "r", stdin);
	int n, m;

	cin >> n >> m;
	for (int i = 0; i < m; i++)
	{
		int node, k, c;
		cin >> node >> k;
		for (int j = 0; j < k; j++)
		{
			cin >> c;
			input[node].push_back(c);
		}
	}
	//dfs(1, 0);
	bfs(1, 0);
	cout << cnt[0];
	for (int i = 1; i <= maxdepth; i++)
	{
		cout << " " << cnt[i];
	}
	return 0;
}

二刷：

吾：思路：遍历每个点，把他们的level和kid完善后，通过按层排序，再进行一次遍历，kid数组大小为0的说明没有孩子，是叶子节点，cnt++。同一层的点遍历结束后，把cnt放入ans，等待最后输出。

 

#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int n, m;
const int maxn = 106,inf=999999;

struct node
{
	int level=inf;
	vector<int> kid;
}v[maxn];


bool cmp(node a, node b)
{
	return a.level < b.level;
}

int main()
{
	//freopen("in.txt", "r", stdin);
	cin >> n >> m;
	if (n==1)
	{
		
		//cout << (m == 0 )? 1 : 0; 如果n==1,即只有一个点，就不用考虑m的值了，因为m若为0，即那仅有的一个点是根同时也是没有孩子的，直接输出1.如果m为1，那输入的数据中第二行要写出根（那仅有的一个点）的孩子节点，但是总共只有一个点，这和n==1矛盾了。所以不用考虑m=1的情况。
		//这里我用已ac的代码自己枚举输入数据的值找这个代码的错误点，自己造的输入值两个代码输出不同的地方很可能是这次代码没有考虑到的地方，所以这里收到了误导，已ac的代码 在输入值为“1 0”的情况下输出为“1 0”。
		//这里我又冷静思考后让这里只输出1，才ac，在写博客的时候，我为了排除由于ide不同的可能性，把一刷的代码放在vs里又跑了一次，结果和二刷代码得到的结果一样，所以这应该是由于vscode和vs的不同ide的问题，不是代码的问题。为了再次排除其他可能性，我在vscode上对“1 0”输入值，分别用两种方式运行，发现是vscode插件run coder的问题，run coder得到的结果是1 0；而crtl+f5用gdb运行结果是1.所以最终问题是插件的缘故。写完博客又用run coder发现结果为1了，是因为用gdb运行过还是因为玄学？
		cout << 1;
		return 0;
	}
	
	int id, k, kid,maxlevel=0;
	vector<int> ans;
	for (int i = 0; i < m; i++)
	{
		cin >> id >> k;
		for (int j = 0; j < k; j++)
		{
			cin >> kid;
			v[id].kid.push_back(kid);
		}
	}
	v[1].level = 1;
	for (int i = 1; i <= n; i++)
	{
		for (int j = 0; j < v[i].kid.size(); j++)
		{
			if (v[v[i].kid[j]].level==inf)
			{
				v[v[i].kid[j]].level = v[i].level + 1;
			}
			if (v[v[i].kid[j]].level!=inf&& v[v[i].kid[j]].level>maxlevel)
			{
				maxlevel = v[v[i].kid[j]].level;
			}
		}
	}
	sort(v,v+maxn, cmp);
	int index = 1;
	for (int i = 1; i <= maxlevel; i++)
	{
		int cnt = 0;
		while (v[index].level==i)
		{
			if (v[index].kid.size()==0)
			{
				cnt++;
			}
			index++;
		}
		ans.push_back(cnt);
	}


	//output
	if (!ans.empty())
	{
		cout << ans[0];
	}
	
	for (int i = 1; i < ans.size(); i++)
	{
		cout << " " << ans[i];
	}
	return 0;
}