PAT (Advanced Level) 1053 Path of Equal Weight （30 分）

最新推荐文章于 2022-02-15 16:28:09 发布

isunLt

最新推荐文章于 2022-02-15 16:28:09 发布

阅读量137

点赞数 1

分类专栏： PAT 文章标签： PAT

本文链接：https://blog.csdn.net/isunLt/article/details/87447868

版权

PAT 专栏收录该内容

92 篇文章 1 订阅

订阅专栏

1053 Path of Equal Weight （30 分）

Given a non-empty tree with root R, and with weight Wi assigned to each tree node Ti. 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³⁰, the given weight number. The next line contains N positive numbers where Wi (<1000) corresponds to the tree node Ti. 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,A2,⋯,An} is said to be greater than sequence {B1,B2,⋯,Bm} if there exists 1≤k<min{n,m} such that Ai=Bi for i=1,⋯,k, and Ak+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:

Code:

#include <iostream>
#include <vector>
#include <algorithm>
#pragma warning(disable:4996)
using namespace std;

struct Node
{
	int weight;
	vector<int> child;
};

int m, n, s;
vector<int> temp;
vector<Node> node;

void dfs(int index, int sum)
{
	temp.push_back(node[index].weight); //处理当前节点，先加入路径向量
	if (sum + node[index].weight == s && node[index].child.size() == 0) //如果sum == s 而且这个节点是叶子节点
	{
		for (int i = 0; i < temp.size(); i++)
			printf("%d%c", temp[i], (i == temp.size() - 1 ? '\n' : ' ')); //输出整条路径
	}
	else //否则
	{
		for (int i = 0; i < node[index].child.size(); i++)
			dfs(node[index].child[i], sum + node[index].weight); //处理他的孩子节点
	}
	temp.pop_back(); // 处理完成，弹出这个节点。
}

int main()
{
	scanf("%d%d%d", &m, &n, &s);	
	for (int i = 0; i < m; i++)
	{
		Node t;
		scanf("%d", &t.weight);
		node.push_back(t);
	}
	for (int i = 0; i < n; i++)
	{
		int id, cn, c;
		scanf("%d%d", &id, &cn);
		for (int i = 0; i < cn; i++)
		{
			scanf("%d", &c);
			node[id].child.push_back(c);
		}
		sort(node[id].child.begin(), node[id].child.end(), [](const int n1, const int n2) {
			return node[n1].weight > node[n2].weight;
		}); //输入时，直接按权重排序，保证先被输出的一定是权重大的节点
	}
	dfs(0, 0);
	return 0;
}