Ramu and his friends

CodeChefOpen on judge ↗

Ramu gave you a list of students having length N. Each one of them have some money, say $M_{i} (1 \leq i \leq N)$. Ramu can create friendship between these students. If student $a$ and $b$ are friends and student b and c are friends, then student a and c are also friends. He asks you $Q$ queries of 3 types as described below. Query 1 : $1$ $a$ $b$ Student $a$ and student $b$

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