Chef and Queries on a Tree

CodeChefRating 2862Open on judge ↗

Chef has a tree with $N$ nodes numbered $1$ through $N$. Each node of the tree has a weight; let's denote the weight of node $v$ by $a_v$. Chef should answer $Q$ queries. Each query is described by an integer $r$ and a list of $k$ nodes $u_1, u_2, \dots, u_k$. In each query, let $S$ be the connected subgraph of the tree (i.e. a subtree) which contains the nodes $u_1, u_2, \dots, u_k$ and has 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