CF1867D.Cyclic Operations
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Egor has an array a of length n , initially consisting of zeros. However, he wanted to turn it into another array b of length n .
Since Egor doesn't take easy paths, only the following operation can be used (possibly zero or several times):
- choose an array l of length k ( 1≤li≤n , all li are distinct) and change each element ali to l(i%k)+1 ( 1≤i≤k ).
He became interested in whether it is possible to get the array b using only these operations. Since Egor is still a beginner programmer, he asked you to help him solve this problem.
The operation % means taking the remainder, that is, a%b is equal to the remainder of dividing the number a by the number b .
输入格式
The first line of the input contains an integer t ( 1≤t≤105 ) - the number of test cases.
Each test case consists of two lines. The first line contains two integers n and k ( 1≤k≤n≤105 ).
The second line contains the array b1,b2,…,bn ( 1≤bi≤n ).
It is guaranteed that the sum of n over all test cases does not exceed 2⋅105 .
输出格式
For each test case, output "YES" (without quotes) if there is a way to get the array b using only the given operation. Otherwise, output "NO" (without quotes). You can output each letter in any case (lowercase or uppercase). For example, the strings "yEs", "yes", "Yes" and "YES" will be accepted as a positive answer.
输入输出样例
输入#1
6 5 3 2 3 5 3 4 4 2 2 4 3 1 1 1 1 3 1 1 2 3 5 3 5 4 3 2 1 6 1 1 2 3 1 5 6
输出#1
YES NO YES YES NO NO
说明/提示
Let's consider the first example:
- Apply the operation with l = [1,2,3] . Now a = [2,3,1,0,0] .
- Apply the operation with l = [3,5,4] . Now a = [2,3,5,3,4] = b .
We see that it is possible to get the array b . Therefore, the answer is YES.In the second example, it can be proven that the array b cannot be obtained, therefore the answer is NO.