CF1833C.Vlad Building Beautiful Array
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Vlad was given an array a of n positive integers. Now he wants to build a beautiful array b of length n from it.
Vlad considers an array beautiful if all the numbers in it are positive and have the same parity. That is, all numbers in the beautiful array are greater than zero and are either all even or all odd.
To build the array b , Vlad can assign each bi either the value ai or ai−aj , where any j from 1 to n can be chosen.
To avoid trying to do the impossible, Vlad asks you to determine whether it is possible to build a beautiful array b of length n using his array a .
输入格式
The first line of input contains an integer t ( 1≤t≤104 ) — the number of test cases.
Then follow the descriptions of the test cases.
The first line of each case contains a single integer n ( 1≤n≤2⋅105 ) — the length of the array a .
The second line of each case contains n positive integers a1,a2,…,an ( 1≤ai≤109 ) — the elements of the array a .
It is guaranteed that the sum of n over all cases does not exceed 2⋅105 .
输出格式
Output t strings, each of which is the answer to the corresponding test case. As the answer, output "YES" if Vlad can build a beautiful array b , and "NO" otherwise.
You can output the answer in any case (for example, the strings "yEs", "yes", "Yes" and "YES" will be recognized as a positive answer).
输入输出样例
输入#1
7 5 2 6 8 4 3 5 1 4 7 6 9 4 2 6 4 10 7 5 29 13 9 10000001 11 3 5 2 1 2 4 2 5 2 4 5 4 3 4 2 5 5 4
输出#1
NO YES YES YES YES NO NO