There is a binary tree with l leaves (1 ≤ l ≤ 50) where each leaf k has an amount of nutrients n_{k} (1 ≤ n_{k} ≤ 10000) that it produces.

The branches (which you can think of as edges) of this binary tree limit the maximum amount of nutrients that can flow to the root of the tree. You have X growth agents (1 ≤ X ≤ 2500) that can be used to increase the thickness of an edge or increase the nutrient production of a leaf node. Initially, each edge has a weight of 1 and if you give it w growth agents then it can transport (1 + w)^{2} nutrients. Increasing the nutrient production of a leaf with initial value n_{k} by s raises the nutrient production of that leaf to n_{k} + s.

Notice that when edges meet, the amount of nutrient that flows is the sum of nutrients flowing along the incoming edges.

Find the maximum amount of nutrients you can transport to the root.

**Input**

The first line of input will be a description of the tree. This description can be defined recursively as either an integer n_{k} (1 ≤ n_{k} ≤ 10000) or as (T_{L} T_{R}) where T_{L} and T_{R} are descriptions of the left and right subtrees, respectively. The second line of input will be the integer X, the amount of growth agents you have. Note: at least 30% of the marks for this question have l ≤ 5 and X ≤ 50.

**Output**

On one line, output the maximum amount of nutrients that can flow into the root of the tree.

**Sample Input**

(5 ((7 1) (3 4)))

3

**Sample Output**

7

**Explanation**

The tree description can be illustrated as:

Notice that if we put two growth factors on the left edge of the root, and one growth factor on the right edge of the root. Then, there will be 5 nutrients flowing from the leaf labelled 5 to the root (since the capacity is (1+2)^{2} = 9 units of nutrients) and 2 nutrients flowing from the right subtree (since the capacity is (1+1)^{2} = 4, but there are only 2 units of nutrients due to limits of 1 on the edges attached to all other leaves).

Alternatively, notice that increasing the nutrient production of the left leaf of the root to 6, and increasing the capacity of the root to the left leaf by 2 (to give a capacity of (1+2)^{2} = 9 units) would cause 6 units of nutrients to flow into the root from the left tree, and the right subtree of the root would produce 1 unit of nutrient.

In both cases, the maximum amount of nutrients that can reach the root node is 7.

import re class TreeNode: def __init__(self, value, leftChild, rightChild): self.value = int(value) self.left = leftChild self.right = rightChild self.maxNutrients = [] def createTreeNode(string): print(string) s = string.strip(); if s.startswith("(") and not s.startswith("((") and not s.startswith("( ("): # Starts with a single parenthesis first_digit = re.findall("\d+",s)[0] index = s.find(first_digit) second_string = s[index + 1:] second_index = second_string.find(" ") second_string = second_string[second_index + 1:] print("left") print(re.findall("\d+",s)[0]) print("right") print(second_string) return TreeNode(0, createTreeNode(re.findall("\d+",s)[0]), createTreeNode(second_string)) elif not s.startswith("("): # String starts with a digital number return TreeNode(re.findall("\d+",s)[0], None, None) else: #String starts with multiple parenthesis s = s[1: (len(s) - 1)].strip() print("multiple parenthesis") print(s) if s.startswith("("): count = 1; i = 1; while count: if s[i] == '(': count += 1 elif s[i] == ')': count -= 1 i += 1; print("left node") print(s[0:i]) print("right node") print(s[i+1:]) return TreeNode(0, createTreeNode(s[0:i]), createTreeNode(s[i+1:])) def optimize(node, growth): if node.left == None: #node is a leaf leaf = node leaf.maxNutrients = [0] * (growth + 1) for i in range(0, growth + 1): leaf.maxNutrients[i] = leaf.value + i else: n = node optimize(n.left, growth) optL = [0] * (growth + 1) for i in range(0, growth + 1): max = 0 for j in range(0, i + 1): tmp = min((1 + j) * (1 + j), n.left.maxNutrients[i - j]) if tmp > max: max = tmp optL[i] = max optimize(n.right, growth) optR = [0]*(growth + 1) for i in range(0, growth + 1): max = 0 for j in range(0, i + 1): tmp = min((1 + j) * (1 + j), n.right.maxNutrients[i - j]) if tmp > max: max = tmp optR[i] = max n.maxNutrients = [0]*(growth + 1) for i in range(0, growth + 1): max = 0 for j in range(0, i + 1): tmp = optL[j] + optR[i - j] if tmp > max: max = tmp n.maxNutrients[i] = max file = open("s5.6.in", "r") tree_string = file.readline() root = createTreeNode(tree_string) growth = int(file.readline()) optimize(root, growth) print(root.maxNutrients[growth])

赞赏

微信赞赏支付宝赞赏