Codeforces Round #717 (Div. 2) B. AGAGA XOOORRR (思维)

传送门

让我们来考虑不同的情况：

定义sum = a1 ^ a2 ^ a3 … ^an;

if a1 = a2 = a3 … = an, n为奇数，sum == a1;
if a1 = a2 = a3 … = an, n为偶数, sum == 0;

所以当一个数组的sum==0时，必然满足条件。
当sum != 0时，我们就找数组有多少个字串的sum == 原数组的sum，且数量为奇数个大于等于3；

#include<bits/stdc++.h>
using namespace std;
 
typedef long long LL;         
typedef pair<int, int> P;
 
const int maxn = 2e6 + 10;        
const int M_MAX = 50000 + 10;
const int mod = 1e9 + 7;
const LL INF = 1e17;    
const double eps = 1e-6;     
const double pi = acos(-1);
 
int arr[3000];
 
void solve() {
    int n; cin >> n;
    LL sum = 0;
    for(int i = 1; i <= n; i++) { cin >> arr[i]; sum ^= arr[i]; }
    if(sum == 0) { cout << "YES\n"; return ; }
    LL temp = 0;
    for(int i = 1; i <= n; i++) {
        temp ^= arr[i];
        if(temp == sum) {
            temp = 0;
            for(int j = i + 1; j <= n; j++) {
                temp ^= arr[j];
                if(temp == sum) {
                    cout << "YES\n";
                    return ;
                }
            }
            cout << "NO\n";
            return ;
        }
    }
}
 
int main()
{
    ios::sync_with_stdio(false);
    //freopen("D:\\in.txt", "r", stdin);
    int t; cin >> t;
    while(t--) {
        solve();
    }
    return 0;
}