## Editorial for DMOPC '22 Contest 4 P6 - K-Sort

**only**when stuck, and

**not to copy-paste code from it**. Please be respectful to the problem author and editorialist.

**Submitting an official solution before solving the problem yourself is a bannable offence.**

Author:

## Subtask 1

Notice that items to don't have to move if is a subsequence of the array. We can calculate which items don't have to move, and move everything else in order, largest to smallest.

## 55%

We can use a similar strategy to the first subtask, but on both sides. Colour indices before in red, and those after in blue. Index is purple. Any element in the list which is not in the correct section must be moved to the correct section (, the purple element, is always in the correct section). Start from the side that allows the middle element to land on the correct side. If the middle element is purple, choose the side with more elements.

After the elements are on the correct sides, apply the subtask 1 algorithm to both sides, starting from the side with the purple element.

Thanks to

for finding this solution.## Subtask 2

In a case like `2 5 3 1 4 7 6`

with `K = 2`

, the solution for 55% is suboptimal because after moving to the right side, it has to be put in place with . However, it would be optimal to simply start with `6 5`

, and the reference solution outputs `6 1 2 5 4 3`

for this case.

Instead of proceeding in two parts, we should sort everything together all at once. Note that doing an operation on an element that resides on the left moves the middle element left, and vice versa. Thus, after moving an element, we need to pick an element from the side corresponding to the colour. For example, after playing in the above case, we have to play a move from the right side, or will end up on the wrong side.

At the beginning, we can try starting from both sides, whichever one we choose will determine the direction of the element initially at position . We can simply take the minimum of both answers.

Furthermore, at any time, we only have two good moves. After we calculate the elements that don't need to move (left as an exercise), either the largest element not in place or the smallest one not in place can be played. If, of the two moves, only one is available (because the other would push our middle element in the wrong direction), take it. If both are available, greedily take the one that keeps us on the current side.

If neither are available, use the purple element as a means of resetting. If the purple element is not on the current side, use the other side as the starting side. It can be proven that this always results in an answer.

## Comments