A16022 | Tenzing and Books
时间限制1s
内存限制256MB
通过 / 提交0/0
题目描述
Tenzing received $3n$ books from his fans. The books are arranged in $3$ stacks with $n$ books in each stack. Each book has a non-negative integer difficulty rating.
Tenzing wants to read some (possibly zero) books. At first, his knowledge is $0$ .
To read the books, Tenzing will choose a non-empty stack, read the book on the top of the stack, and then discard the book. If Tenzing's knowledge is currently $u$ , then his knowledge will become $u|v$ after reading a book with difficulty rating $v$ . Here $|$ denotes the [bitwise OR operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR). Note that Tenzing can stop reading books whenever he wants.
Tenzing's favourite number is $x$ . Can you help Tenzing check if it is possible for his knowledge to become $x$ ?
Tenzing wants to read some (possibly zero) books. At first, his knowledge is $0$ .
To read the books, Tenzing will choose a non-empty stack, read the book on the top of the stack, and then discard the book. If Tenzing's knowledge is currently $u$ , then his knowledge will become $u|v$ after reading a book with difficulty rating $v$ . Here $|$ denotes the [bitwise OR operation](https://en.wikipedia.org/wiki/Bitwise_operation#OR). Note that Tenzing can stop reading books whenever he wants.
Tenzing's favourite number is $x$ . Can you help Tenzing check if it is possible for his knowledge to become $x$ ?
输入格式
Each test contains multiple test cases. The first line of input contains a single integer $t$ ( $1 \le t \le 10^4$ ) — the number of test cases. The description of test cases follows.
The first line of each test case contains two integers $n$ and $x$ ( $1 \leq n \leq 10^5$ , $0 \leq x \leq 10^9$ ) — the number of books in each stack and Tenzing's favourite number.
The second line of each test case contains $n$ integers $a_1,a_2,\ldots,a_n$ ( $0 \leq a_i \leq 10^9$ ) — the difficulty rating of the books in the first stack, from top to bottom.
The third line of each test case contains $n$ integers $b_1,b_2,\ldots,b_n$ ( $0 \leq b_i \leq 10^9$ ) — the difficulty rating of the books in the second stack, from top to bottom.
The fourth line of each test case contains $n$ integers $c_1,c_2,\ldots,c_n$ ( $0 \leq c_i \leq 10^9$ ) — the difficulty rating of the books in the third stack, from top to bottom.
It is guaranteed that the sum of $n$ does not exceed $10^5$ .
The first line of each test case contains two integers $n$ and $x$ ( $1 \leq n \leq 10^5$ , $0 \leq x \leq 10^9$ ) — the number of books in each stack and Tenzing's favourite number.
The second line of each test case contains $n$ integers $a_1,a_2,\ldots,a_n$ ( $0 \leq a_i \leq 10^9$ ) — the difficulty rating of the books in the first stack, from top to bottom.
The third line of each test case contains $n$ integers $b_1,b_2,\ldots,b_n$ ( $0 \leq b_i \leq 10^9$ ) — the difficulty rating of the books in the second stack, from top to bottom.
The fourth line of each test case contains $n$ integers $c_1,c_2,\ldots,c_n$ ( $0 \leq c_i \leq 10^9$ ) — the difficulty rating of the books in the third stack, from top to bottom.
It is guaranteed that the sum of $n$ does not exceed $10^5$ .
输出格式
For each test case, output "Yes" (without quotes) if Tenzing can make his knowledge equal to $x$ , and "No" (without quotes) otherwise.
You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.
You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses.
输入输出样例
输入 #1
3 5 7 1 2 3 4 5 5 4 3 2 1 1 3 5 7 9 5 2 3 2 3 4 5 5 4 3 2 1 3 3 5 7 9 3 0 1 2 3 3 2 1 2 2 2
输出 #1
Yes No Yes
For the first test case, Tenzing can read the following $4$ books:
- read the book with difficulty rating $1$ on the top of the first stack. Tenzing's knowledge changes to $0|1=1$ .
- read the book with difficulty rating $1$ on the top of the third stack. Tenzing's knowledge changes to $1|1=1$ .
- read the book with difficulty rating $2$ on the top of the first stack. Tenzing's knowledge changes to $1|2=3$ .
- read the book with difficulty rating $5$ on the top of the second stack. Tenzing's knowledge changes to $3|5=7$ .
After reading all books, Tenzing's knowledge is $7$ .
For the third test case, Tenzing can read $0$ books to make his final knowledge equals to $0$ .
- read the book with difficulty rating $1$ on the top of the first stack. Tenzing's knowledge changes to $0|1=1$ .
- read the book with difficulty rating $1$ on the top of the third stack. Tenzing's knowledge changes to $1|1=1$ .
- read the book with difficulty rating $2$ on the top of the first stack. Tenzing's knowledge changes to $1|2=3$ .
- read the book with difficulty rating $5$ on the top of the second stack. Tenzing's knowledge changes to $3|5=7$ .
After reading all books, Tenzing's knowledge is $7$ .
For the third test case, Tenzing can read $0$ books to make his final knowledge equals to $0$ .
C++ 编辑器
输入
输出
可保存默认模板;新题优先使用已保存模板。
当前快捷键仅展示,暂不支持修改。
- 撤销
Ctrl / ⌘ + Z - 重做
Ctrl / ⌘ + Y - 查找
Ctrl / ⌘ + F - 全选
Ctrl / ⌘ + A - 复制
Ctrl / ⌘ + C - 剪切
Ctrl / ⌘ + X - 粘贴
Ctrl / ⌘ + V - 自动排版
工具栏排版按钮 - 草稿保存
编辑时自动保存到本机
历史
提交记录
状态说明时间源码
AI
作答助手
你好,我是作答助手。可以问思路、复杂度、样例含义或代码报错原因;不会直接给出完整 AC 代码。
确定要清空代码吗?
提交通过
评测结果:Accepted