MEXor Mixup（MEX运算和异或运算）

最新推荐文章于 2024-05-07 15:05:53 发布

eyuhaobanga

最新推荐文章于 2024-05-07 15:05:53 发布

阅读量1.3k

点赞数 1

文章标签：蓝桥杯 gnu c++

本文链接：https://blog.csdn.net/eyuhaobanga/article/details/122848069

版权

Problem - 1567B - Codeforces

MEX运算就是除去本身以外其他非负整数的集合中的最小值，如MEX{1}=0，MEX{0,1,2,4,5}=3...这道题问的是除了a以外数组的异或和等于b的最短数组长度是多少，那么这个数组至少包含了0到a-1，那就处理一下前缀异或和，如果恰好等于b的话直接输出a，如果前缀异或和异或b不等于a的话说明一定有一个不等于a的元素如果加入进数组的话再异或一定能等于b，那么直接输出a+1，如果恰好等于a的话就需要用另外的两个数的异或和来代替a，所以说出a+2

AC代码：

/*
Tips:
   1.int? long long?
   2.don't submit wrong answer
   3.figure out logic first, then start writing please
   4.know about the range
   5.check if you have to input t or not
   6.modulo of negative numbers is not a%b, it is a%b + abs(b)
*/
#pragma GCC optimize(2)
#pragma GCC optimize(3)
#pragma GCC optimize("Ofast")
#include <iostream>
#include <queue>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <string>
#include <cctype>
#include <map>
#include <vector>
#include <deque>
#include <set>
#include <stack>
#include <numeric>
#include <iomanip>
#include <functional>
using namespace std;
#define lowbit(x) ((x) & -(x))
#define IOS1 ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define IOS2 ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
typedef vector<int> vi;
typedef vector<long long> vll;
typedef vector<char> vc;
typedef long long ll;
template<class T> T gcd(T a, T b) { return b ? gcd(b, a % b) : a; }
template<class T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
template<class T>
T power(T a, int b) {
	T res = 1;
	for (; b; b >>= 1, a = a * a) {
		if (b & 1) {
			res = res * a;
		}
	}
	return res;
}
template <typename T>
inline void read(T& x)
{
	x = 0; int f = 1; char ch = getchar();
	while (!isdigit(ch)) { if (ch == '-') f = -1; ch = getchar(); }
	while (isdigit(ch)) { x = x * 10 + ch - '0', ch = getchar(); }
	x *= f;
}
const int INF = 0x3f3f3f3f;
const int mod = 1000000007;
const double PI = acos(-1.0);
const double eps = 1e-6;
int c[300010];
void solve() {
	int a, b;
	cin >> a >> b;
	if (c[a - 1] == b) {
		cout << a << endl;
	}
	else {
		if ((c[a - 1] ^ b) == a) {
			cout << a + 2 << endl;
		}
		else {
			cout << a + 1 << endl;
		}
	}
}
int main() {
	IOS1;
	//IOS2;
	for (int i = 1; i <= 300000; i++) {
		c[i] = c[i - 1] ^ i;
	}
	int __t = 1;
	cin >> __t;
	for (int _t = 1; _t <= __t; _t++) {
		solve();
	}
	return 0;
}
/*

*/