Aloy & Search Party

CodeChefOpen on judge ↗

Aloy and her search party are on an expedition to explore all cauldrons. There $N$ cauldrons , where $i^{th}$ having a location denoted by {$X_{i}$ , $Y_{i}$ , $Z_{i}$}. There are some cauldrons who are linked together. According to Aloy the link power between two cauldrons $i$ and $j$ is : $ \sqrt[2]{((x_i - y_j) + (y_i-x_j))^2 + ((y_i - z_j) + (z_i - y_j))^2 + ((z_i - x_j) + (x_i - z_j))^2

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