have w white dominoes (2×1 tiles, the two cells are hued in white) and b dark dominoes (2×1 tiles, the two cells are shaded in dark). You can put a white domino on the board in case both board's cells are white and not involved by some other domino. Similarly, you can put a dark domino if the two cells are dark and not involved by some other domino.
Correct answer will be upvoted else downvoted. Computer science.
You have w white dominoes (2×1 tiles, the two cells are hued in white) and b dark dominoes (2×1 tiles, the two cells are shaded in dark).
You can put a white domino on the board in case both board's cells are white and not involved by some other domino. Similarly, you can put a dark domino if the two cells are dark and not involved by some other domino.
Would you be able to put all w+b dominoes on the board if you can put dominoes both on a level plane and in an upward direction?
Input
The main line contains a solitary integer t (1≤t≤3000) — the number of experiments.
The primary line of each experiment contains three integers n, k1 and k2 (1≤n≤1000; 0≤k1,k2≤n).
The second line of each experiment contains two integers w and b (0≤w,b≤n).
Output
For each experiment, print YES in case it's feasible to put all w+b dominoes on the board and negative, in any case.
You might print each letter regardless you need (thus, for instance, the strings yEs, indeed, Yes and YES are completely perceived as certain reply).
Step by step
Solved in 4 steps with 1 images
