A14384 | Take Your Places!
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
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.
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.
输入格式
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.
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.
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.
It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$ .
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.
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.
It is guaranteed that the sum of $n$ over all test cases does not exceed $10^5$ .
输出格式
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.
输入输出样例
输入 #1
5 3 6 6 1 1 9 6 1 1 1 2 2 2 2 8 6 6 6 2 3 4 5 1
输出 #1
1 0 3 -1 2
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]$
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]$
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted