Ghatak Problem

CodeChefOpen on judge ↗

Ms. Ghatak is a geek! Being a geek has side-effects as many of you might known. Geeks can never leave a problem unsolved be it in practice or during the contest! As Ghatak has a date with Gandey, Please solve her problem ASAP! Given an undirected tree with N nodes each Node having an initial value 0, you have to process Q queries which are of two types as described below. - 1 u v c - Update the

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI