codeforces 1567 B. MEXor Mixup

最新推荐文章于 2022-07-05 16:57:12 发布

zuhiul

最新推荐文章于 2022-07-05 16:57:12 发布

阅读量323

点赞数 1

分类专栏： cf 数学文章标签：算法 c++ acm竞赛

本文链接：https://blog.csdn.net/mengzhongsharen/article/details/120273046

版权

本文介绍了codeforces 1567 B. MEXor Mixup问题，讨论如何找到具有特定MEX和XOR值的最短非负整数数组。给出了分析和解决方案，证明了最短数组的存在性和长度计算方法。

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

本场比赛其他题目的题解

A. Domino Disaster
B. MEXor Mixup
C. Carrying Conundrum
D. Expression Evaluation Error
E. Non-Decreasing Dilemma

B. MEXor Mixup

开启传送门

题目描述

Alice gave Bob two integers $a$ and $b$ ( $a > 0$ and $\ge 0$ ). Being a curious boy, Bob wrote down an array of non-negative integers with $\operatorname{MEX}$ value of all elements equal to $a$ and $\operatorname{XOR}$ value of all elements equal to $b$ .

What is the shortest possible length of the array Bob wrote?

Recall that the $\operatorname{MEX}$ () of an array is the minimum non-negative integer that does not belong to the array and the $\operatorname{XOR}$ of an array is the bitwise XOR of all the elements of the array.

Input

The input consists of multiple test cases. The first line contains an integer $t$ ( $\leq t \leq 5 \cdot 10^4$ ) — the number of test cases. The description of the test cases follows.

The only line of each test case contains two integers $a$ and $b$ ( $\leq a \leq 3 \cdot 10^5$ ; $\leq b \leq 3 \cdot 10^5$ ) — the $\operatorname{MEX}$ and $\operatorname{XOR}$ of the array, respectively.