CF1516B AGAGA XOOORRR-CSDN博客

本文链接：https://blog.csdn.net/ABCZ168/article/details/132313782

文章讲述了BabyEhab对数组进行异或操作的问题，他试图通过删除相邻元素并替换为它们的异或值，使得数组所有元素相等，同时至少保留2个元素。讨论了如何判断在给定条件下是否可行。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

AGAGA XOOORRR

题目描述

Baby Ehab is known for his love for a certain operation. He has an array $a$ of length $n$ , and he decided to keep doing the following operation on it:

he picks $ 2 $ adjacent elements; he then removes them and places a single integer in their place: their bitwise XOR. Note that the length of the array decreases by one.

Now he asks you if he can make all elements of the array equal. Since babies like to make your life harder, he requires that you leave at least $2$ elements remaining.

输入格式

The first line contains an integer $t$ ( $\le t \le 15$ ) — the number of test cases you need to solve.

The first line of each test case contains an integers $n$ ( $\le n \le 2000$ ) — the number of elements in the array $a$ .

The second line contains $ n $ space-separated integers $a_1$ , $a_2$ , $\ldots$ , $a_{n}$ ( $\le a_i < 2^{30}$ ) — the elements of the array $a$ .

输出格式

If Baby Ehab can make all elements equal while leaving at least $2$ elements standing, print “YES”. Otherwise, print “NO”.

样例 #1

样例输入 #1

样例输出 #1

YES
NO

提示

In the first sample, he can remove the first $2$ elements, $0$ and $2$ , and replace them by $\oplus 2=2$ . The array will be $[2, 2]$ , so all the elements are equal.

In the second sample, there’s no way to make all the elements equal.

题面翻译

给定一个 $n$ 长度的数组 $a$ ，可以进行操作：

将数组相邻的两个元素删除，并在原来的位置插入这两个元素的异或和。

求在最多删除 $n - 2$ 个元素（即至少剩余 $2$ 个元素）的情况下能否使数组所有元素相等。

思路：

容易想到最后留下的数要么 $2$ 个，要么 $3$ 个。这很好证明。

如果有 $n$ 个数相等，那么我一定可以拉出来两个数，异或一下，变成 $0$ ，然后随便搞到一个数身上。由于最后不可以只留下一个数，所以留下的数要么 $2$ 个，要么 $3$ 个。

$2$ 个数的情况很好判断，只需要判断所有数异或起来是否等于 $0$ 。

$3$ 个数也很好做，注意到 $N$ 的范围，我们可以直接枚举三个区间，利用好维护好的前缀和搞一下即可。

代码：

#include <bits/stdc++.h>

#define LL long long
using namespace std;
const int N = 2e3 + 10 , INF = 0x3f3f3f3f;
inline LL read(){
	   LL x = 0 , f = 1 ; char ch = getchar();
	   while (ch < '0'||ch > '9'){if (ch == '-') f = -1 ; ch = getchar();}
	   while (ch >= '0'&&ch <= '9'){x = x * 10 + ch - 48 ; ch = getchar();}
	   return x * f;
}
void write(LL x){
    if(x < 0)
        putchar('-'),x = -x;
    if(x > 9)
        write(x / 10);
    putchar(x % 10 + '0');
}
LL a[N]; 
LL f[N] , b[N];
signed main(){
	int T = read();
	while(T --){
		int n = read() , g; bool flag = 0;
		for(int i = 1;i <= n;i ++)
			cin >> a[i];
		b[n + 1] = 0; f[0] = 0;
		for(int i = 1;i <= n;i ++) f[i] = f[i - 1] ^ a[i];
		for(int i = n;i >= 1;i --) b[i] = b[i + 1] ^ a[i];
		for(int i = 2;i <= n - 1;i ++){
			g = 0;
			for(int j = i ;j < n;j ++){
				g ^= a[j];
				if(g == f[i - 1] && g == b[j + 1]) {
					flag = 1;
					break ;
				}
			}
		}
		if(!f[n]) flag = 1;
		puts( flag ? "YES" : "NO");
	}
	      
	return 0;
}