CF1823B.Sort with Step

普及/提高-

通过率：0%

AC君温馨提醒

该题目为【codeforces】题库的题目，您提交的代码将被提交至codeforces进行远程评测，并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供，我们无法保证该服务的稳定性，若提交后无反应，请等待一段时间后再进行重试。

题目描述

Let's define a permutation of length $n$ as an array $p$ of length $n$ , which contains every number from $1$ to $n$ exactly once.

You are given a permutation $p_1, p_2, \dots, p_n$ and a number $k$ . You need to sort this permutation in the ascending order. In order to do it, you can repeat the following operation any number of times (possibly, zero):

pick two elements of the permutation $p_i$ and $p_j$ such that $|i - j| = k$ , and swap them.

Unfortunately, some permutations can't be sorted with some fixed numbers $k$ . For example, it's impossible to sort $[2, 4, 3, 1]$ with $k = 2$ .

That's why, before starting the sorting, you can make at most one preliminary exchange:

choose any pair $p_i$ and $p_j$ and swap them.

Your task is to:

check whether is it possible to sort the permutation without any preliminary exchanges,
if it's not, check, whether is it possible to sort the permutation using exactly one preliminary exchange.

For example, if $k = 2$ and permutation is $[2, 4, 3, 1]$ , then you can make a preliminary exchange of $p_1$ and $p_4$ , which will produce permutation $[1, 4, 3, 2]$ , which is possible to sort with given $k$ .

输入格式

Each test contains multiple test cases. The first line contains the number of test cases $t$ ( $1 \le t \le 10^4$ ). The description of the test cases follows.

The first line of each test case contains two integers $n$ and $k$ ( $2 \le n \le 2 \cdot 10^5$ ; $1 \le k \le n - 1$ ) — length of the permutation, and a distance between elements that can be swapped.

The second line of each test case contains $n$ integers $p_1, p_2, \dots, p_n$ ( $1 \le p_i \le n$ ) — elements of the permutation $p$ .

It is guaranteed that the sum of $n$ over all test cases does not exceed $2 \cdot 10 ^ 5$ .

输出格式

For each test case print

0, if it is possible to sort the permutation without preliminary exchange;
1, if it is possible to sort the permutation with one preliminary exchange, but not possible without preliminary exchange;
-1, if it is not possible to sort the permutation with at most one preliminary exchange.

输入输出样例

输入#1

6
4 1
3 1 2 4
4 2
3 4 1 2
4 2
3 1 4 2
10 3
4 5 9 1 8 6 10 2 3 7
10 3
4 6 9 1 8 5 10 2 3 7
10 3
4 6 9 1 8 5 10 3 2 7

输出#1

说明/提示

In the first test case, there is no need in preliminary exchange, as it is possible to swap $(p_1, p_2)$ and then $(p_2, p_3)$ .

In the second test case, there is no need in preliminary exchange, as it is possible to swap $(p_1, p_3)$ and then $(p_2, p_4)$ .

In the third test case, you need to apply preliminary exchange to $(p_2, p_3)$ . After that the permutation becomes $[3, 4, 1, 2]$ and can be sorted with $k = 2$ .

首页