PAT A1053 Path of Equal Weight (30分)

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³⁰, 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 {A_​1,A_​2,⋯,A_​n} is said to be greater than sequence {B_​1,B_​2,⋯,B_​m} if there exists 1≤k<min{n,m} such that A_​i=B_i for i=1,⋯,k, and A_​k+1>B_​k+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；输出从根结点到叶子结点的路径权值和为s的路径.

思路：

(1)将结点的孩子结点按权值从大到小排序，可以确保输出的路径为从大到小的顺序；
(2)先根遍历树，当到达叶子结点时判断当前路径权值和是否与s相等，如果相等则输出当前路径.

代码：

#include <cstdio>
#include <vector>
#include <algorithm> 
using namespace std;
const int maxn = 110;

struct node{//树的静态存储结构 
	int weight;//权值 
	vector<int> child;
}Node[maxn];

bool cmp(int a,int b){//将结点的孩子结点按权值从大到小排序 
	return Node[a].weight>Node[b].weight;
}

int n,m,s,path[maxn];//结点数、非叶子结点数、权值和、从根结点到孩子结点的路径 
void DFS(int root,int layer){//先根遍历（DFS），当到达叶子结点时判断路径权值和是否与s相等，如果相等则输出当前路径 
	path[layer] = Node[root].weight;
	if(Node[root].child.size()==0){//当前结点为叶子结点 
		int sum = 0;
		for(int i=0;i<=layer;i++) sum += path[i];//求当前路径权值和 
		if(sum==s){//判断路径权值和是否于s相等
			for(int i=0;i<=layer;i++){
				printf("%d",path[i]);
				if(i!=layer) printf(" ");
			}
			printf("\n");
		}
		return;
	}
	for(int i=0;i<Node[root].child.size();i++){
		DFS(Node[root].child[i],layer+1); 
	}
}

int main(){
	scanf("%d %d %d",&n,&m,&s);
	for(int i=0;i<n;i++) scanf("%d",&Node[i].weight);
	int id,child,k;
	for(int i=0;i<m;i++){//建树 
		scanf("%d %d",&id,&k);
		for(int j=0;j<k;j++){
			scanf("%d",&child);
			Node[id].child.push_back(child);
		}
		sort(Node[id].child.begin(),Node[id].child.end(),cmp);//对结点id的孩子结点从大到小排序 
	}
	DFS(0,0);
	return 0;
}