Given a tree with N vertices numbered 1 through N with vertex 1 as root vertex and N – 1 edges. We have to color exactly k number of vertices and count the number of uncolored vertices between root vertex and every colored vertex. We have to include the root vertex in the count if it is not colored. The task to maximize the number of uncolored vertices occurring between the path from root vertex and the colored vertices.
Input : 1 / | \ / | \ 2 3 4 / \ \ / \ \ 5 6 7 k = 4 Output : 7 Explanation: If we color vertex 2, 5, 6 and 7, the number of uncolored vertices between the path from root to colored vertices is maximum which is 7. Input : 1 / \ / \ 2 3 / / 4 k = 1 Output : 2
To solve the above-mentioned problem we observe that if a vertex is chosen to be uncolored then its parent must be chosen to be uncolored. Then we can calculate how many uncolored vertices we will get if we choose a certain path to the colored vertex. Simply calculate the difference between the number of vertices between root to each vertex and the number of vertices that occur below the current vertex. Take the largest k of all the difference and calculate the sum. Use nth_element stl to get an O(n) solution.
Below is the implementation of the above approach:
Time Complexity: O(N)
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.