題目
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 < 230, 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
分析
題目大意：輸入一個(gè)有N個(gè)帶權(quán)重節(jié)點(diǎn)，M個(gè)非葉子節(jié)點(diǎn)的樹(shù)放椰，給定一個(gè)S喧半，求路徑從根節(jié)點(diǎn)到葉子節(jié)點(diǎn)權(quán)重加起來(lái)等于S的所有路徑馏予，并按字典序降序輸出事镣。
思路：用結(jié)構(gòu)體數(shù)組建立數(shù)據(jù)結(jié)構(gòu)驶悟，并且在建立時(shí)對(duì)每個(gè)子節(jié)點(diǎn)按權(quán)重大小重新排序焊夸。dfs遍歷的時(shí)候用數(shù)組path對(duì)路徑進(jìn)行跟蹤苛败，最后就直接輸出path中0：childNode-1的權(quán)重水孩。
代碼
#include <iostream>
#include <vector>
#include <algorithm>
#include <queue>
using namespace std;
struct node{
int w;
int child_num;
vector<int> child;
};
vector<int> path;
vector<node> tree;
int N, M, S;
void dfs(int r, int sum_w, int childNode)
{
if(sum_w > S)
return;
if(sum_w == S)
{
if(tree[r].child_num != 0)
return;
for(int j = 0; j<childNode; j++)
{
cout << tree[path[j]].w;
if(j != childNode-1)
cout << " ";
else
cout << endl;
}
}
for(int i = 0; i<tree[r].child_num; i++)
{
path[childNode] = tree[r].child[i];
dfs(tree[r].child[i], sum_w+tree[tree[r].child[i]].w, childNode+1);
}
}
int cmp(int a, int b)
{
return tree[a].w > tree[b].w;
}
int main()
{
cin >> N >> M >> S;
tree.resize(N);
path.resize(N);
for(int i = 0; i<N; i++)
{
cin >> tree[i].w;
}
for(int i = 0; i<M; i++)
{
int ID;
cin >> ID;
cin >> tree[ID].child_num;
tree[ID].child.resize(tree[ID].child_num);
for(int j = 0; j<tree[ID].child_num; j++)
{
cin >> tree[ID].child[j];
}
sort(tree[ID].child.begin(), tree[ID].child.end(), cmp);
}
// for(int i = 0; i<N; i++)
// {
// cout << i << " " << tree[i].w << " " << tree[i].child_num << " ";
// for(int j = 0; j<tree[i].child_num; j++)
// cout << tree[i].child[j] << " ";
// cout << endl;
// }
dfs(0, tree[0].w, 1);
return 0;
}
總結(jié)
柳神的代碼
學(xué)會(huì)如何在遍歷樹(shù)的時(shí)候?qū)ν宦窂竭M(jìn)行跟蹤
利用sort镰矿，實(shí)現(xiàn)樹(shù)按某一屬性（權(quán)重）重新排序
