【PAT甲级A1053】Path of Equal Weight (30分)（c++）

1053 Path of Equal Weight (30分)

作者：CHEN, Yue
单位：浙江大学
代码长度限制：16 KB
时间限制：400 ms
内存限制：64 MB

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

题意：

一棵树，每个结点都有权重，给出一个目标值，在树中选择路径使得路径上结点的权重和等于目标值，路径必须以叶子结点为终点。

思路：

采用dfs深度优先遍历树，边界条件为，路径权重之和等于目标数以及路径终点为叶子结点。（在读取每个结点的孩子结点时，将孩子结点按权重降序，这样输出一定是按照规定顺序输出的）

参考代码：

#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int maxn=110;
int N,M,S;
vector<int> ans;
struct node{
    int weight;
    vector<int> child;
}Node[maxn];
bool cmp(int a,int b){
    return Node[a].weight>Node[b].weight;
}
void dfs(int root,int s)
{
    if(s==S&&Node[root].child.size()==0){
        for(int i=0;i<ans.size();i++){
            printf("%d",ans[i]);
            if(i<ans.size()-1)printf(" ");
            else printf("\n");
        }
        return;
    }
    for(int i=0;i<Node[root].child.size();i++){
        int weight=Node[Node[root].child[i]].weight;
        if(weight+s<=S){
            ans.push_back(weight);
            dfs(Node[root].child[i],s+weight);
            ans.pop_back();
        }
    }
    return;
}
int main()
{
    scanf("%d%d%d",&N,&M,&S);
    for(int i=0;i<N;i++) 
        scanf("%d", &Node[i].weight);
    int index,num,child;
    for(int i=0;i<M;i++){
        scanf("%d%d",&index,&num);
        for(int j=0;j<num;j++){
            scanf("%d",&child);
            Node[index].child.push_back(child);
        }
        sort(Node[index].child.begin(),Node[index].child.end(),cmp);
    }
    ans.push_back(Node[0].weight);
    dfs(0,Node[0].weight);
    return 0;
}

如有错误，欢迎指正