1053. Path of Equal Weight (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.
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 19Sample Output:
10 5 2 7 10 4 10 10 3 3 6 2 10 3 3 6 2
1 #include <iostream> 2 #include <vector> 3 #include <algorithm> 4 5 using namespace std; 6 7 struct Node 8 { 9 int parent = -1; 10 int weight; 11 vector<int> child; 12 }; 13 14 Node tree[100]; 15 int weight[100]; 16 17 18 void CalculateWeight(int root) 19 { 20 vector<int>& vec = tree[root].child; 21 22 for (int i = 0; i < vec.size(); i++) 23 { 24 tree[vec[i]].weight = tree[root].weight + weight[vec[i]]; 25 CalculateWeight(vec[i]); 26 } 27 } 28 29 bool cmp(vector<int> v1, vector<int> v2) 30 { 31 int i = 0; 32 while (i < v1.size() && i < v2.size()) 33 { 34 if (v1[i] != v2[i]) 35 return v1[i] > v2[i]; 36 i++; 37 } 38 return false; 39 } 40 41 int main() 42 { 43 int nodeNum, nonLeafNum, givenWeight; 44 cin >> nodeNum >> nonLeafNum >> givenWeight; 45 46 for (int i = 0; i < nodeNum; i++) 47 cin >> weight[i]; 48 for (int i = 0; i < nonLeafNum; i++) 49 { 50 int parent, childNum; 51 cin >> parent >> childNum; 52 for (int i = 0; i < childNum; i++) 53 { 54 int child; 55 cin >> child; 56 tree[parent].child.push_back(child); 57 tree[child].parent = parent; 58 } 59 } 60 61 tree[0].weight = weight[0]; 62 CalculateWeight(0); 63 64 vector< vector<int> > seq; 65 for (int i = 0; i < nodeNum; i++) 66 { 67 if (tree[i].child.empty() && tree[i].weight == givenWeight) 68 { 69 vector<int> vec; 70 int j = i; 71 while (j != -1) 72 { 73 vec.push_back(weight[j]); 74 j = tree[j].parent; 75 } 76 seq.push_back(vector<int>(vec.rbegin(), vec.rend())); 77 } 78 } 79 sort(seq.begin(), seq.end(), cmp); 80 for (int i = 0; i < seq.size(); i++) 81 { 82 vector<int>& vec = seq[i]; 83 for (int j = 0; j < vec.size() - 1; j++) 84 cout << vec[j] << " "; 85 cout << vec.back() << endl; 86 } 87 }