1556B.md (2332B)
1 Source: https://codeforces.com/problemset/problem/1556/B 2 3 B. Take Your Places! 4 5 time limit per test 6 7 1 second 8 9 memory limit per test 10 11 256 megabytes 12 13 input 14 15 standard input 16 17 output 18 19 standard output 20 21  22 23 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. 24 25 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. 26 27 Input 28 29 Each test contains multiple test cases. The first line contains the number of test cases $t$ ($1 \le t \le 10^4$). Description of the test cases follows. 30 31 The first line of each test case contains an integer $n$ $(1 \le n \le 10^5)$ which is the total number of items in William's array. 32 33 The second line contains $n$ integers $a_1, a_2, \dots, a_n$ $(1 \le a_i \le 10^9)$ which are William's array. 34 35 It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$. 36 37 Output 38 39 For each test case output the minimal number of operations needed or $-1$ if it is impossible to get the array to a state when no neighboring numbers have the same parity. 40 41 Example 42 43 Input 44 45 ``` 46 5 47 3 48 6 6 1 49 1 50 9 51 6 52 1 1 1 2 2 2 53 2 54 8 6 55 6 56 6 2 3 4 5 1 57 ``` 58 59 Output 60 61 ``` 62 1 63 0 64 3 65 -1 66 2 67 ``` 68 69 Note 70 71 In the first test case the following sequence of operations would satisfy the requirements: 72 73 1. swap(2, 3). Array after performing the operation: $[6, 1, 6]$ 74 75 In the second test case the array initially does not contain two neighboring items of the same parity. 76 77 In the third test case the following sequence of operations would satisfy the requirements: 78 79 1. swap(3, 4). Array after performing the operation: $[1, 1, 2, 1, 2, 2]$ 80 2. swap(2, 3). Array after performing the operation: $[1, 2, 1, 1, 2, 2]$ 81 3. swap(4, 5). Array after performing the operation: $[1, 2, 1, 2, 1, 2]$ 82 83 In the fourth test case it is impossible to satisfy the requirements. 84 85 In the fifth test case the following sequence of operations would satisfy the requirements: 86 87 1. swap(2, 3). Array after performing the operation: $[6, 3, 2, 4, 5, 1]$ 88 2. swap(4, 5). Array after performing the operation: $[6, 3, 2, 5, 4, 1]$