PAT(Advanced)1053 Path of Equal Weight C++实现

PAT(Advanced)甲级1053 Path of Equal Weight C++实现

题目链接

1053 Path of Equal Weight

题目大意

给定一棵有N个节点和M个非叶子节点且所有节点都带正整数权值的树以及一个给定权值S，求解从根节点到叶子结点路径累积权值为S的所有路径，并按照非递增序列输出

算法思路

根据树的性质以及树的层次遍历定义，求解路径累积权值为给定值的序列，类似于图的DFS，即树的先序遍历，从根节点递归到叶子节点，若未到达叶子节点但累积权值已经大于S，则往下的路径无序继续遍历，而是回溯继续查找其他路径，若到达叶子节点符合要求，则存储对应路径序列，对于每个非叶子节点都需要递归地遍历其所有孩子节点的对应路径，得到结果后借助sort()函数排序，用逆序迭代器逆序输出即可得到非递增序列

void preOrderTraverse(int p, vector<int> answer, int sum) {
    if (nonLeaves[p].size() == 0 && sum + weights[p] == S) {
    	// 叶子节点且符合要求
        answer.push_back(weights[p]);
        answers.push_back(answer);
        return;
    }
    for (int i = 0; i < nonLeaves[p].size(); i++) {
    	// 对于当前节点的所有孩子节点
        if (sum + weights[p] < S) {
        	// 若累积权值未大于S
            answer.push_back(weights[p]);
            preOrderTraverse(nonLeaves[p][i], answer, sum + weights[p]);
            // 回溯，查找其他路径
            answer.pop_back();
        }
    }
}

AC代码

/*
author : eclipse
email  : eclipsecs@qq.com
time   : Fri Jun 26 21:22:05 2020
*/
#include <bits/stdc++.h>
using namespace std;

int N, M, S;
vector<int> weights;
vector<vector<int> > nonLeaves;

vector<vector<int> > answers;


void preOrderTraverse(int p, vector<int> answer, int sum) {
    if (nonLeaves[p].size() == 0 && sum + weights[p] == S) {
        answer.push_back(weights[p]);
        answers.push_back(answer);
        return;
    }
    for (int i = 0; i < nonLeaves[p].size(); i++) {
        if (sum + weights[p] < S) {
            answer.push_back(weights[p]);
            preOrderTraverse(nonLeaves[p][i], answer, sum + weights[p]);
            answer.pop_back();
        }
    }
}

int main(int argc, char const *argv[]) {
    scanf("%d%d%d", &N, &M, &S);
    weights.resize(N);
     for (int i = 0; i < N; i++) {
        scanf("%d", &weights[i]);
    }
    nonLeaves.resize(N);
    for (int i = 0; i < M; i++) {
        int ID;
        int K;
        scanf("%d%d", &ID, &K);
        for (int j = 0; j < K; j++) {
            int child;
            scanf("%d", &child);
            nonLeaves[ID].push_back(child);
        }
    }
    vector<int> answer;
    preOrderTraverse(0, answer, 0);

    sort(answers.begin(), answers.end());

    for (vector<vector<int> >::reverse_iterator it = answers.rbegin() ; it != answers.rend(); it++) {
        vector<int>::iterator i = it->begin();
        printf("%d", *i++);
        for (; i != it->end(); i++) {
            printf(" %d", *i);
        }
        printf("\n");
    }
    return 0;
}

样例输入

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

样例输出

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

鸣谢

PAT

最后

• 由于博主水平有限，不免有疏漏之处，欢迎读者随时批评指正，以免造成不必要的误解！