Add By Permutation
You're given an array of integers $A$ and a permutation $P$, each of size $N$. Recall that a permutation of length $N$ is an array where every element from $1$ to $N$ occurs exactly once. The following operation is performed on the array $K$ times: - For each index $i$ ($1 \le i \le N$), add $A_{P_i}$ to $A_i$ **simultaneously**. For example, if $A = [2, 6, 1, 7]$ and $P = [3, 1, 4, 2]$, after o
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.
Sign in to chat with the tutor and save your progress.
Sign in to start