问题 G: Cyperation

内存限制：128 MB 时间限制：1 S 标准输入输出

题目类型：传统评测方式：文本比较上传者：

提交：4 通过：2

链接：https://ac.nowcoder.com/acm/contest/57361/G
来源：牛客网

Given a circular array

a

of length

n

and a positive integer

k

, you can perform the following operation any number of times (including zero):

Select two indices $i$ and $j$ ( $\leq i < j \leq n$ ) such that $min⁡(j−i,n+i−j)=k\min(j-i, n+i-j) = k$ , which means the minimum distance between $i$ and $j$ on the circular array is $k$ , and subtract $1$ from both $a_i$ and $a_j$ .

Determine if it is possible to transform the entire array into

0

. If possible, outputYES; otherwise, outputNO.

You are given

T

test cases. Find the answer for each of them.

The first line contains a positive integer $T$ ( $\leq T \leq 10^6$ ) , denoting the number of test cases. The first line of each test case contains two positive integers $n$ and $k$ ( $\leq n \leq 10^6$ , $\leq k \leq n$ ), indicating the length of the array $a$ and the minimum distance of $i$ and $j$ for each index selection. The second line consists of $n$ non-negative integers $a_i$ ( $\leq a_i \leq 10^9$ ).

It is guaranteed that $\leq \sum n \leq 10^6$ .

For each test case, output one string per line, either "YES" or "NO" (without quotes), indicating whether it is possible or not.

5
5 2
3 0 5 1 3
6 3
5 0 0 3 0 0
5 5
1 2 3 4 5
6 1
0 0 1 0 0 1
7 2
1 1 0 1 1 1 1

YES
NO
NO
NO
YES

For the first test case, perform these operations:

(1, 3), (1, 3), (1, 4), (3, 5), (3, 5), (3, 5)

.
For the third test case, you can't do any operation, so it's impossible to transform the entire array into

0

2023牛客暑期多校训练营7

问题 G: Cyperation

题目描述

输入格式

输出格式

输入样例复制

输出样例复制

数据范围与提示

分类标签

问题 G: Cyperation

题目描述

输入格式

输出格式

输入样例 复制

输出样例 复制

数据范围与提示

分类标签

输入样例复制

输出样例复制