Problem: Harshikaa and the Rain CodeChef Solution
There is a tree with NN nodes numbered from 11 to NN outside Harshikaa’s house. The tree is rooted at node 11. Initially the tree was dry, there were no raindrops on any node of the tree. Suddenly it started raining, and every second a drop falls on all the leaf nodes of the tree. Also, every second any drop which wasn’t already on the root node moves one node closer to the root.
Sometimes, strong winds shake the tree and all drops which were not on the root fall off. It is known that the wind will shake the tree MM times at A1,A2,…AMA1,A2,…AM seconds after it started raining.
If multiple events happen at the same second, they are in this order:
- Raindrops move one node closer to the root.
- New raindrops fall on the leaves.
- Wind shakes the tree.
How many drops are there at the root right after the MM-th shake?
- The first line of each input contains TT – the number of test cases. The test cases then follow.
- The first line of each test case contains two space-separated integers NN and MM – the number of nodes on the tree and the number of shake events.
- N−1N−1 lines follow, each line containing two space-separated integers UU and VV denoting an edge between node UU and VV on the tree.
- The next line contains MM space-separated integers A1,A2,…,AMA1,A2,…,AM – the timestamp of the shakes.
For each test case, output in a single line the number of raindrops on the root right after the MM-th shake.
- AA is strictly increasing
- Sum of NN over all test cases is not more than 5⋅1055⋅105
- Sum of MM over all test cases is not more than 4⋅1054⋅105
Sample Input 1
Sample Output 1
- Test case 11: Let’s define an array RR, where RiRi is the number of raindrops on the ii-th node.
- At second 00, R=[0,0,0,0,0]R=[0,0,0,0,0].
- At second 11, a raindrop fell on all leaves. RR becomes [0,1,0,1,1][0,1,0,1,1].
- At second 22,
- Firstly, raindrops moved closer to the root, so RR becomes [1,0,2,0,0][1,0,2,0,0].
- Secondly, a raindrop fell on all leaves, so RR becomes [1,1,2,1,1][1,1,2,1,1].
- Thirdly, the tree was shook, so every raindrop except the one on root fell. At the end of second 22, R=[1,0,0,0,0]R=[1,0,0,0,0].
- At second 33, new raindrops fell, and RR becomes [1,1,0,1,1][1,1,0,1,1].
- At second 44, RR becomes [2,1,2,1,1][2,1,2,1,1].
- At second 55,
- Firstly, raindrops moved closer to the root, so RR becomes [5,0,2,0,0][5,0,2,0,0].
- Secondly, a raindrop fell on all leaves, so RR becomes [5,1,2,1,1][5,1,2,1,1].
- Thirdly, the tree was shook, so every raindrop except the one on root fell. At the end of second 55, R=[5,0,0,0,0]R=[5,0,0,0,0].
Therefore, at the end there were 55 drops at the root.
Harshikaa and the Rain CodeChef Solution Review:
In our experience, we suggest you solve this Harshikaa and the Rain CodeChef Solution and gain some new skills from Professionals completely free and we assure you will be worth it.
Harshikaa and the Rain Problem is available on Hacker Rank for Free, if you are stuck anywhere between a compilation, just visit Queslers to get Harshikaa and the Rain CodeChef Solution.
I hope this Harshikaa and the Rain CodeChef Solution would be useful for you to learn something new from this problem. If it helped you then don’t forget to bookmark our site for more Hacker Rank, Leetcode, Codechef, Codeforce Solution.
This Problem is intended for audiences of all experiences who are interested in learning about Data Science in a business context; there are no prerequisites.
More on Queslers >>
Cognitive Class Answers
Coursera Quiz Answers