Problem — Minimum Ugliness Appeared in the Wednesday contest on CodeChef.

My Solution — https://www.codechef.com/viewsolution/96660756

Approach (Using Binary Uplifting) →

• (Precomputing) Binary Uplifting using DFS.
• For Each query, identifying one endpoint of the longest diameter from given set
• Calculating distance using LCM from above node to all nodes present in set, answer is (maximum distance / 2).

To Calculate Endpoint

• Fix an arbitrary vertex let it be x.
• Find the furthest vertex from x, let it be req_node.
• req_node is Endpoint.

It is failing on 4/8 testcases.

Concept Used:

• Lowest Common Ancestor — Binary Lifting: Binary Lifting (CP Algorithm),
• Diameter of Tree & Application: Blog

The CodeHive Coding Competition was organized by the Newton School Coding Club at PCCOE on the HackerRank platform. The contest was designed to start with very basic concepts and gradually increase in difficulty.

The whole contest can be accessed via the following link: CodeHive Contest

For all participants, the links to the questions and their respective editorials are provided below:

1. Explore Pandora: Problem Link
   • Editorial: https://mirror.codeforces.com/blog/entry/112129
2. Survival Match: Problem Link
   • Editorial: https://mirror.codeforces.com/blog/entry/112069
3. Bitwise Education: Problem Link
   • Editorial: https://mirror.codeforces.com/blog/entry/112087
4. Dragon Race: Problem Link
   • Editorial: https://mirror.codeforces.com/blog/entry/112063
5. Alien Mass Communication: Problem Link
   • Editorial: https://mirror.codeforces.com/blog/entry/112114
6. Max Avatar Time: Problem Link
   • Editorial: https://mirror.codeforces.com/blog/entry/112318
7. Na'vi Arrow: Problem Link
   • Editorial: https://mirror.codeforces.com/blog/entry/112140
8. Distributing Fruits: Problem Link
   • Editorial: https://mirror.codeforces.com/blog/entry/112091

We kindly ask all participants to take some time to review all of the questions and editorials and provide their feedback and opinions.
Your insights and suggestions will help us to make improvements and ensure that future CodeHive Coding Competitions are even more engaging and challenging.

Checkout Out Future Events on https://nsccpccoe.web.app/

Thank you for your support and participation!

Best regards,
Newton School Coding Club,
Pimpri Chinchwad College of Engineering