Tree Coin Collecting II

CSESAdvanced Graph ProblemsOpen on judge ↗

You are given a tree with n nodes. Some nodes contain a coin. Your task is to answer q queries of the form: what is the shortest length of a path from node a to node b that visits all nodes with coins? Input The first line contains two integers n and q: the number of nodes and queries. The nodes are numbered 1, 2, \dots, n. The second line contains n integers c_1, c_2,\dots, c_n. If c_i = 1, n

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