Boboniu Likes to Color Balls CodeForces

本文链接：https://blog.csdn.net/qq_45891413/article/details/108073151

该博客讨论了如何通过操作将不同颜色的球排列成回文串的条件。给定红、绿、蓝、白四种颜色的球数量，允许的操作是将一个红色、绿色和蓝色的球变成白色。你需要判断经过若干次操作后，是否能形成回文排列。博客提供了输入输出示例，并解释了奇偶性判断在解决此问题中的关键作用。

摘要由CSDN通过智能技术生成

Boboniu gives you

r red balls,
g green balls,
b blue balls,
w white balls.
He allows you to do the following operation as many times as you want:

Pick a red ball, a green ball, and a blue ball and then change their color to white.
You should answer if it’s possible to arrange all the balls into a palindrome after several (possibly zero) number of described operations.

Input
The first line contains one integer T (1≤T≤100) denoting the number of test cases.

For each of the next T cases, the first line contains four integers r, g, b and w (0≤r,g,b,w≤109).

Output
For each test case, print “Yes” if it’s possible to arrange all the balls into a palindrome after doing several (possibly zero) number of described operations. Otherwise, print “No”.

Example
Input
4
0 1 1 1
8 1 9 3
0 0 0 0
1000000000 1000000000 1000000000 1000000000
Output
No
Yes
Yes
Yes
Note
In the first test case, you’re not able to do any operation and you can never arrange three balls of distinct colors into a palindrome.

In the second test case, after doing one operation, changing (8,1,9,3) to (7,0,8,6), one of those possible palindromes may be “rrrwwwbbbbrbbbbwwwrrr”.

A palindrome is a word, phrase, or sequence that reads the same backwards as forwards. For example, “rggbwbggr”, “b”, “gg” are palindromes while “rgbb”, “gbbgr” are not. Notice that an empty word, phrase, or sequence is palindrome.
三个颜色的球换一个白球，对四个球的数量进行奇偶判断，只有一个奇数或者没有奇数可以组成回文；前三个中有一种没有球一定不能组成；四个球中有3、4个奇数时，可以通过转换成3、4个偶数组成回文