Office play

CodeChefOpen on judge ↗

A company has N (Numbered 1 - N) offices and each office belongs to one of their M (numbered 1 - M) different departments. The offices follow a tree hierarchy where each office has a supervising office. We define the Kth supervising office as the Kth ancestor of the current office. An important activity in the company is the transfer of documents between two offices. These two offices always belo

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