Prefix Permutation

CodeChefRating 1532Open on judge ↗

You are given an array $A$ of length $K$. Find any permutation $P$ of length $N$ such that only the prefixes of length $A_i$ ($1 \le i \le K$) form a permutation. Under the given constraints, it is guaranteed that there exists at least one permutation which satisfies the given condition. If there are multiple solutions, you may print any. Note: A permutation of length $N$ is an array where ever

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