3 Array Sort

CodeChefOpen on judge ↗

You are given 3 array A, B, C of size N. Each array constrains a permutation of numbers from 1 to N. In one operation you can select any 'i' from 1 to 'N' and swap A[B[C[i]]] with A[C[B[i]]]. Can you sort the array 'A' using some finite number of operations ? You can perform as many operations as you like. ### Input First line contains an integer 'T' denoting the number of test cases. - The f

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