PATH QUERIES

CodeChefOpen on judge ↗

You are given a tree with $N$ nodes, $N - 1$ edges and array $A[i]$ denoting a value at a particular node $i$ ($1 \leq i \leq N$). The root of the tree is always $1$. ``` int F(int x,int parity){ if(x==1){ if((A[x]%2) == (parity%2) ) return A[x]; return 0; } if(( A[x]%2) == (parity%2) ){ return A[x] + F(parent[x],parity); }e

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