A12510 | Crazy Diamond
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You are given a permutation $p$ of integers from $1$ to $n$ , where $n$ is an even number.
Your goal is to sort the permutation. To do so, you can perform zero or more operations of the following type:
- take two indices $i$ and $j$ such that $2 \cdot |i - j| \geq n$ and swap $p_i$ and $p_j$ .
There is no need to minimize the number of operations, however you should use no more than $5 \cdot n$ operations. One can show that it is always possible to do that.
Your goal is to sort the permutation. To do so, you can perform zero or more operations of the following type:
- take two indices $i$ and $j$ such that $2 \cdot |i - j| \geq n$ and swap $p_i$ and $p_j$ .
There is no need to minimize the number of operations, however you should use no more than $5 \cdot n$ operations. One can show that it is always possible to do that.
输入格式
The first line contains a single integer $n$ ( $2 \leq n \leq 3 \cdot 10^5$ , $n$ is even) — the length of the permutation.
The second line contains $n$ distinct integers $p_1, p_2, \ldots, p_n$ ( $1 \le p_i \le n$ ) — the given permutation.
The second line contains $n$ distinct integers $p_1, p_2, \ldots, p_n$ ( $1 \le p_i \le n$ ) — the given permutation.
输出格式
On the first line print $m$ ( $0 \le m \le 5 \cdot n$ ) — the number of swaps to perform.
Each of the following $m$ lines should contain integers $a_i, b_i$ ( $1 \le a_i, b_i \le n$ , $|a_i - b_i| \ge \frac{n}{2}$ ) — the indices that should be swapped in the corresponding swap.
Note that there is no need to minimize the number of operations. We can show that an answer always exists.
Each of the following $m$ lines should contain integers $a_i, b_i$ ( $1 \le a_i, b_i \le n$ , $|a_i - b_i| \ge \frac{n}{2}$ ) — the indices that should be swapped in the corresponding swap.
Note that there is no need to minimize the number of operations. We can show that an answer always exists.
输入输出样例
输入 #1
2 2 1
输出 #1
1 1 2
输入 #2
4 3 4 1 2
输出 #2
4 1 4 1 4 1 3 2 4
输入 #3
6 2 5 3 1 4 6
输出 #3
3 1 5 2 5 1 4
In the first example, when one swap elements on positions $1$ and $2$ , the array becomes sorted.
In the second example, pay attention that there is no need to minimize number of swaps.
In the third example, after swapping elements on positions $1$ and $5$ the array becomes: $[4, 5, 3, 1, 2, 6]$ . After swapping elements on positions $2$ and $5$ the array becomes $[4, 2, 3, 1, 5, 6]$ and finally after swapping elements on positions $1$ and $4$ the array becomes sorted: $[1, 2, 3, 4, 5, 6]$ .
In the second example, pay attention that there is no need to minimize number of swaps.
In the third example, after swapping elements on positions $1$ and $5$ the array becomes: $[4, 5, 3, 1, 2, 6]$ . After swapping elements on positions $2$ and $5$ the array becomes $[4, 2, 3, 1, 5, 6]$ and finally after swapping elements on positions $1$ and $4$ the array becomes sorted: $[1, 2, 3, 4, 5, 6]$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted