PAT 1053 Path of Equal Weight (30)

1053 Path of Equal Weight (30)（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 Figure 1: 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 Figure 1.

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 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:

10 5 2 7
10 4 10
10 3 3 6 2
10 3 3 6 2

思路：

题目是要我们找出从树根到叶子权值和为S的路径。首先要建树，因为输出时要降序，所以在输入中间节点到孩子的边的时候，可以排个序，这样dfs的时候出来的结果直接就是题目要求的。还要注意的是，dfs时找到了权值和为S的路径时，还要注意判断一下结束的节点是不是叶子。

代码：

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>  
#include <set>
using namespace std;

struct node
{
	int val;
	vector<int> next;
};

vector<node> tree;
int n, m, s, sum = 0, k = 1;
int path[105] = {0};

void dfs(int root)
{
	if (sum == s)
	{
		if (tree[root].next.size())
			return;
		for (int i = 0; i < k - 1; i++)
			cout << path[i] << " ";
		cout << path[k - 1] << endl;
		return;
	}
	if (sum > s)
		return;
	for (int i = 0; i < tree[root].next.size(); i++)
	{
		int t = tree[root].next[i];
		path[k++] = tree[t].val;
		sum += tree[t].val;
		dfs(t);
		sum-= tree[t].val;
		k--;
	}
}

bool cmp(const int &a, const int &b)
{
	return tree[a].val > tree[b].val;
}

int main()
{
	cin >> n >> m >> s;
	for (int i = 0; i < n; i++)
	{
		node n;
		cin >> n.val;
		tree.push_back(n);
	}
	for (int i = 0; i < m; i++)
	{
		int a, b, num;
		cin >> a >> num;
		for (int j = 0; j < num; j++)
		{
			cin >> b;
			tree[a].next.push_back(b);
		}
		if (num > 1)
			sort(tree[a].next.begin(), tree[a].next.end(), cmp);
	}
	path[0] = tree[0].val;
	sum += tree[0].val;
	dfs(0);
	return 0;
}