Package g2901_3000.s2925_maximum_score_after_applying_operations_on_a_tree

Class Solution

  • All Implemented Interfaces:
    
public final class Solution

    2925 - Maximum Score After Applying Operations on a Tree\.

    Medium

    There is an undirected tree with n nodes labeled from 0 to n - 1, and rooted at node 0. You are given a 2D integer array edges of length n - 1, where <code>edgesi = a<sub>i</sub>, b<sub>i</sub></code> indicates that there is an edge between nodes <code>a<sub>i</sub></code> and <code>b<sub>i</sub></code> in the tree.

    You are also given a 0-indexed integer array values of length n, where values[i] is the value associated with the <code>i<sup>th</sup></code> node.

    You start with a score of 0. In one operation, you can:

    • Pick any node i.

    • Add values[i] to your score.

    • Set values[i] to 0.

    A tree is healthy if the sum of values on the path from the root to any leaf node is different than zero.

    Return the maximum score you can obtain after performing these operations on the tree any number of times so that it remains healthy.

    Example 1:

    Input: edges = \[\[0,1],0,2,0,3,2,4,4,5], values = 5,2,5,2,1,1

    Output: 11

    Explanation: We can choose nodes 1, 2, 3, 4, and 5. The value of the root is non-zero. Hence, the sum of values on the path from the root to any leaf is different than zero. Therefore, the tree is healthy and the score is values1 + values2 + values3 + values4 + values5 = 11. It can be shown that 11 is the maximum score obtainable after any number of operations on the tree.

    Example 2:

    Input: edges = \[\[0,1],0,2,1,3,1,4,2,5,2,6], values = 20,10,9,7,4,3,5

    Output: 40

    Explanation: We can choose nodes 0, 2, 3, and 4.

    • The sum of values on the path from 0 to 4 is equal to 10.

    • The sum of values on the path from 0 to 3 is equal to 10.

    • The sum of values on the path from 0 to 5 is equal to 3.

    • The sum of values on the path from 0 to 6 is equal to 5.

    Therefore, the tree is healthy and the score is values0 + values2 + values3 + values4 = 40.

    It can be shown that 40 is the maximum score obtainable after any number of operations on the tree.

    Constraints:

    • <code>2 <= n <= 2 * 10<sup>4</sup></code>

    • edges.length == n - 1

    • edges[i].length == 2

    • <code>0 <= a<sub>i</sub>, b<sub>i</sub>< n</code>

    • values.length == n

    • <code>1 <= valuesi<= 10<sup>9</sup></code>

    • The input is generated such that edges represents a valid tree.

    • Nested Class Summary

      Nested Classes 
      Modifier and Type Class Description

    • Field Summary

      Fields 
      Modifier and Type Field Description

    • Constructor Summary

      Constructors 
      Constructor Description
      Solution()

    • Enum Constant Summary

      Enum Constants 
      Enum Constant Description

    • Method Summary

      Modifier and Type Method Description
      final Long maximumScoreAfterOperations(Array<IntArray> edges, IntArray values)

      • Methods inherited from class java.lang.Object

        clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait