A14069 | Domino on Windowsill
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
You have a board represented as a grid with $2 \times n$ cells.
The first $k_1$ cells on the first row and first $k_2$ cells on the second row are colored in white. All other cells are colored in black.
You have $w$ white dominoes ( $2 \times 1$ tiles, both cells are colored in white) and $b$ black dominoes ( $2 \times 1$ tiles, both cells are colored in black).
You can place a white domino on the board if both board's cells are white and not occupied by any other domino. In the same way, you can place a black domino if both cells are black and not occupied by any other domino.
Can you place all $w + b$ dominoes on the board if you can place dominoes both horizontally and vertically?
The first $k_1$ cells on the first row and first $k_2$ cells on the second row are colored in white. All other cells are colored in black.
You have $w$ white dominoes ( $2 \times 1$ tiles, both cells are colored in white) and $b$ black dominoes ( $2 \times 1$ tiles, both cells are colored in black).
You can place a white domino on the board if both board's cells are white and not occupied by any other domino. In the same way, you can place a black domino if both cells are black and not occupied by any other domino.
Can you place all $w + b$ dominoes on the board if you can place dominoes both horizontally and vertically?
输入格式
The first line contains a single integer $t$ ( $1 \le t \le 3000$ ) — the number of test cases.
The first line of each test case contains three integers $n$ , $k_1$ and $k_2$ ( $1 \le n \le 1000$ ; $0 \le k_1, k_2 \le n$ ).
The second line of each test case contains two integers $w$ and $b$ ( $0 \le w, b \le n$ ).
The first line of each test case contains three integers $n$ , $k_1$ and $k_2$ ( $1 \le n \le 1000$ ; $0 \le k_1, k_2 \le n$ ).
The second line of each test case contains two integers $w$ and $b$ ( $0 \le w, b \le n$ ).
输出格式
For each test case, print YES if it's possible to place all $w + b$ dominoes on the board and NO, otherwise.
You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES are all recognized as positive answer).
You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes and YES are all recognized as positive answer).
输入输出样例
输入 #1
5 1 0 1 1 0 1 1 1 0 0 3 0 0 1 3 4 3 1 2 2 5 4 3 3 1
输出 #1
NO YES NO YES YES
In the first test case, $n = 1$ , $k_1 = 0$ and $k_2 = 1$ . It means that $2 \times 1$ board has black cell $(1, 1)$ and white cell $(2, 1)$ . So, you can't place any white domino, since there is only one white cell.
In the second test case, the board of the same size $2 \times 1$ , but both cell are white. Since $w = 0$ and $b = 0$ , so you can place $0 + 0 = 0$ dominoes on the board.
In the third test case, board $2 \times 3$ , but fully colored in black (since $k_1 = k_2 = 0$ ), so you can't place any white domino.
In the fourth test case, cells $(1, 1)$ , $(1, 2)$ , $(1, 3)$ , and $(2, 1)$ are white and other cells are black. You can place $2$ white dominoes at positions $((1, 1), (2, 1))$ and $((1, 2), (1, 3))$ and $2$ black dominoes at positions $((1, 4), (2, 4))$ $((2, 2), (2, 3))$ .
In the second test case, the board of the same size $2 \times 1$ , but both cell are white. Since $w = 0$ and $b = 0$ , so you can place $0 + 0 = 0$ dominoes on the board.
In the third test case, board $2 \times 3$ , but fully colored in black (since $k_1 = k_2 = 0$ ), so you can't place any white domino.
In the fourth test case, cells $(1, 1)$ , $(1, 2)$ , $(1, 3)$ , and $(2, 1)$ are white and other cells are black. You can place $2$ white dominoes at positions $((1, 1), (2, 1))$ and $((1, 2), (1, 3))$ and $2$ black dominoes at positions $((1, 4), (2, 4))$ $((2, 2), (2, 3))$ .
C++ 编辑器
输入
输出
可保存默认模板；新题优先使用已保存模板。
当前快捷键仅展示，暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好，我是作答助手。可以问思路、复杂度、样例含义或代码报错原因；不会直接给出完整 AC 代码。
确定要清空代码吗？