A14401 | Permutation Shift
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
An identity permutation of length $n$ is an array $[1, 2, 3, \dots, n]$ .
We performed the following operations to an identity permutation of length $n$ :
- firstly, we cyclically shifted it to the right by $k$ positions, where $k$ is unknown to you (the only thing you know is that $0 \le k \le n - 1$ ). When an array is cyclically shifted to the right by $k$ positions, the resulting array is formed by taking $k$ last elements of the original array (without changing their relative order), and then appending $n - k$ first elements to the right of them (without changing relative order of the first $n - k$ elements as well). For example, if we cyclically shift the identity permutation of length $6$ by $2$ positions, we get the array $[5, 6, 1, 2, 3, 4]$ ;
- secondly, we performed the following operation at most $m$ times: pick any two elements of the array and swap them.
You are given the values of $n$ and $m$ , and the resulting array. Your task is to find all possible values of $k$ in the cyclic shift operation.
We performed the following operations to an identity permutation of length $n$ :
- firstly, we cyclically shifted it to the right by $k$ positions, where $k$ is unknown to you (the only thing you know is that $0 \le k \le n - 1$ ). When an array is cyclically shifted to the right by $k$ positions, the resulting array is formed by taking $k$ last elements of the original array (without changing their relative order), and then appending $n - k$ first elements to the right of them (without changing relative order of the first $n - k$ elements as well). For example, if we cyclically shift the identity permutation of length $6$ by $2$ positions, we get the array $[5, 6, 1, 2, 3, 4]$ ;
- secondly, we performed the following operation at most $m$ times: pick any two elements of the array and swap them.
You are given the values of $n$ and $m$ , and the resulting array. Your task is to find all possible values of $k$ in the cyclic shift operation.
输入格式
The first line contains one integer $t$ ( $1 \le t \le 10^5$ ) — the number of test cases.
Each test case consists of two lines. The first line contains two integers $n$ and $m$ ( $3 \le n \le 3 \cdot 10^5$ ; $0 \le m \le \frac{n}{3}$ ).
The second line contains $n$ integers $p_1, p_2, \dots, p_n$ ( $1 \le p_i \le n$ , each integer from $1$ to $n$ appears in this sequence exactly once) — the resulting array.
The sum of $n$ over all test cases does not exceed $3 \cdot 10^5$ .
Each test case consists of two lines. The first line contains two integers $n$ and $m$ ( $3 \le n \le 3 \cdot 10^5$ ; $0 \le m \le \frac{n}{3}$ ).
The second line contains $n$ integers $p_1, p_2, \dots, p_n$ ( $1 \le p_i \le n$ , each integer from $1$ to $n$ appears in this sequence exactly once) — the resulting array.
The sum of $n$ over all test cases does not exceed $3 \cdot 10^5$ .
输出格式
For each test case, print the answer in the following way:
- firstly, print one integer $r$ ( $0 \le r \le n$ ) — the number of possible values of $k$ for the cyclic shift operation;
- secondly, print $r$ integers $k_1, k_2, \dots, k_r$ ( $0 \le k_i \le n - 1$ ) — all possible values of $k$ in increasing order.
- firstly, print one integer $r$ ( $0 \le r \le n$ ) — the number of possible values of $k$ for the cyclic shift operation;
- secondly, print $r$ integers $k_1, k_2, \dots, k_r$ ( $0 \le k_i \le n - 1$ ) — all possible values of $k$ in increasing order.
输入输出样例
输入 #1
4 4 1 2 3 1 4 3 1 1 2 3 3 1 3 2 1 6 0 1 2 3 4 6 5
输出 #1
1 3 1 0 3 0 1 2 0
Consider the example:
- in the first test case, the only possible value for the cyclic shift is $3$ . If we shift $[1, 2, 3, 4]$ by $3$ positions, we get $[2, 3, 4, 1]$ . Then we can swap the $3$ -rd and the $4$ -th elements to get the array $[2, 3, 1, 4]$ ;
- in the second test case, the only possible value for the cyclic shift is $0$ . If we shift $[1, 2, 3]$ by $0$ positions, we get $[1, 2, 3]$ . Then we don't change the array at all (we stated that we made at most $1$ swap), so the resulting array stays $[1, 2, 3]$ ;
- in the third test case, all values from $0$ to $2$ are possible for the cyclic shift:
- if we shift $[1, 2, 3]$ by $0$ positions, we get $[1, 2, 3]$ . Then we can swap the $1$ -st and the $3$ -rd elements to get $[3, 2, 1]$ ;
- if we shift $[1, 2, 3]$ by $1$ position, we get $[3, 1, 2]$ . Then we can swap the $2$ -nd and the $3$ -rd elements to get $[3, 2, 1]$ ;
- if we shift $[1, 2, 3]$ by $2$ positions, we get $[2, 3, 1]$ . Then we can swap the $1$ -st and the $2$ -nd elements to get $[3, 2, 1]$ ;
- in the fourth test case, we stated that we didn't do any swaps after the cyclic shift, but no value of cyclic shift could produce the array $[1, 2, 3, 4, 6, 5]$ .
- in the first test case, the only possible value for the cyclic shift is $3$ . If we shift $[1, 2, 3, 4]$ by $3$ positions, we get $[2, 3, 4, 1]$ . Then we can swap the $3$ -rd and the $4$ -th elements to get the array $[2, 3, 1, 4]$ ;
- in the second test case, the only possible value for the cyclic shift is $0$ . If we shift $[1, 2, 3]$ by $0$ positions, we get $[1, 2, 3]$ . Then we don't change the array at all (we stated that we made at most $1$ swap), so the resulting array stays $[1, 2, 3]$ ;
- in the third test case, all values from $0$ to $2$ are possible for the cyclic shift:
- if we shift $[1, 2, 3]$ by $0$ positions, we get $[1, 2, 3]$ . Then we can swap the $1$ -st and the $3$ -rd elements to get $[3, 2, 1]$ ;
- if we shift $[1, 2, 3]$ by $1$ position, we get $[3, 1, 2]$ . Then we can swap the $2$ -nd and the $3$ -rd elements to get $[3, 2, 1]$ ;
- if we shift $[1, 2, 3]$ by $2$ positions, we get $[2, 3, 1]$ . Then we can swap the $1$ -st and the $2$ -nd elements to get $[3, 2, 1]$ ;
- in the fourth test case, we stated that we didn't do any swaps after the cyclic shift, but no value of cyclic shift could produce the array $[1, 2, 3, 4, 6, 5]$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？
提交通过
评测结果：Accepted