PAT A 甲级 1053 Path of Equal Weight (30分)

1053 Path of Equal Weight (30分)

吐槽

这什么莫名其妙的输出排序要求啊喂！我实现这个排序的用时比完成题目主干内容还长……

题意

有一棵树，每个节点有重量（或者其实是“权值”？），从根到一个叶称作一条路径，路径的重量为路径上各节点重量之和，求所有重量为要求值的路径并将他们按同层节点重量的从大到小排列

思路

其实感觉题目没什么难度啊。因为每条路径是从根到叶，而每个节点的父节点有且只有一个，所以记录父节点比记录子节点更高效——最后把每个叶节点路径向上追溯，算出重量，即可知道哪些路径合法。

*如果是从根到叶递归计算的操作，似乎会有靠动态规划从而快于本算法的余地，但是这道题的数据量不需要动态规划。（说实话我觉得需要动态规划的话才更符合它30分的分值）

至于排序……反正就是sort函数+cmp函数解决。（我用时长是因为本来的stack+及时输出的结构被迫改成了vector+保存、排序后输出）

新学习

在sort使用的cmp函数中，true和false代表的是“需要变化位置”和“不需要变化位置”。所以要比较的两个东西相等时应该return false。

代码

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

using namespace std;

bool cmp(vector<int> v1, vector<int> v2)
{
	int i = 0;
	while (i < v1.size() && i < v2.size())
	{
		if (v1[i] < v2[i])
			return false;
		else if (v1[i] > v2[i])
			return true;
		i++;
	}
	return false;
}

typedef struct
{
	int weight;
	int father;
	bool leaf = true;
}Node;

int main()
{
	int n, m, s, i, ii, temp, temp2, temp3;
	cin >> n >> m >> s;
	Node* node;
	node = new Node[n];
	vector<vector<int>> vv;
	vector<int> v;
	for (i = 0; i < n; i++)
	{
		cin >> node[i].weight;
	}
	for (i = 0; i < m; i++)
	{
		cin >> temp >> temp2;
		node[temp].leaf = false;
		for (ii = 0; ii < temp2; ii++)
		{
			cin >> temp3;
			node[temp3].father = temp;
		}
	}
	for (i = 0; i < n; i++)
	{
		if (!node[i].leaf)
			continue;
		temp = i;
		temp2 = 0;
		while (temp != 0 && temp2 < s)
		{
			temp2 += node[temp].weight;
			temp = node[temp].father;
		}
		temp2 += node[0].weight;
		if (temp2 == s)
		{
			v.clear();
			temp = i;
			while (temp != 0)
			{
				v.push_back(node[temp].weight);
				temp = node[temp].father;
			}
			reverse(v.begin(), v.end());
			vv.push_back(v);
		}
	}

	sort(vv.begin(), vv.end(), cmp);
	for (i = 0; i < vv.size(); i++)
	{
		cout << node[0].weight;
		for (ii = 0; ii < vv[i].size(); ii++)
		{
			cout << " " << vv[i][ii];
		}
		cout << endl;
	}
	return 0;
}

题目

Given a non-empty tree with root R, and with weight W​i assigned to each tree node T​i. The weight of a path from R to L is defined to be the sum of the weights of all the nodes along the path from R to any leaf node L.

Now given any weighted tree, you are supposed to find all the paths with their weights equal to a given number. For example, let’s consider the tree showed in the following figure: for each node, the upper number is the node ID which is a two-digit number, and the lower number is the weight of that node. Suppose that the given number is 24, then there exists 4 different paths which have the same given weight: {10 5 2 7}, {10 4 10}, {10 3 3 6 2} and {10 3 3 6 2}, which correspond to the red edges in the figure.

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, M (<N), the number of non-leaf nodes, and 0<S<2​30, the given weight number. The next line contains N positive numbers where W​i(<1000) corresponds to the tree node T​i. 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 00.

Output Specification:
For each test case, print all the paths with weight S in non-increasing order. Each path occupies a line with printed weights from the root to the leaf in order. All the numbers must be separated by a space with no extra space at the end of the line.

Note: sequence {A1,A​2,⋯,An} is said to be greater than sequence {B​1,B​2,⋯,Bm} if there exists 1≤k<min{n,m} such that Ai=B​i for i=1,⋯,k, and A​k+1>Bk+1.

Sample Input:
20 9 24
10 2 4 3 5 10 2 18 9 7 2 2 1 3 12 1 8 6 2 2
00 4 01 02 03 04
02 1 05
04 2 06 07
03 3 11 12 13
06 1 09
07 2 08 10
16 1 15
13 3 14 16 17
17 2 18 19

Sample Output:
10 5 2 7
10 4 10
10 3 3 6 2
10 3 3 6 2