CF1556B Take Your Places!
Description
William has an array of $ n $ integers $ a_1, a_2, \dots, a_n $ . In one move he can swap two neighboring items. Two items $ a_i $ and $ a_j $ are considered neighboring if the condition $ |i - j| = 1 $ is satisfied.
William wants you to calculate the minimal number of swaps he would need to perform to make it so that the array does not contain two neighboring items with the same parity.
Input Format
N/A
Output Format
N/A
Explanation/Hint
In the first test case the following sequence of operations would satisfy the requirements:
1. swap(2, 3). Array after performing the operation: $ [6, 1, 6] $
In the second test case the array initially does not contain two neighboring items of the same parity.
In the third test case the following sequence of operations would satisfy the requirements:
1. swap(3, 4). Array after performing the operation: $ [1, 1, 2, 1, 2, 2] $
2. swap(2, 3). Array after performing the operation: $ [1, 2, 1, 1, 2, 2] $
3. swap(4, 5). Array after performing the operation: $ [1, 2, 1, 2, 1, 2] $
In the fourth test case it is impossible to satisfy the requirements.
In the fifth test case the following sequence of operations would satisfy the requirements:
1. swap(2, 3). Array after performing the operation: $ [6, 3, 2, 4, 5, 1] $
2. swap(4, 5). Array after performing the operation: $ [6, 3, 2, 5, 4, 1] $