题目链接:https://www.luogu.com.cn/problem/P9236
题目思路:
先使用求出数组A的前缀异或和数组P,即P[ i ] = A [1]^A [2]^.....^A [i],考虑异或的性质,即b^b=0,A^b^b=A,则第L个元素到第R个元素的异或和为P[R]^P[L-1],也就是对n内的每一对i<j,求所有P[j]^p[i-1]的和。
但是如果单纯加和是O(n*n)的,会tle。我们考虑每一位相加,也就是拆位,在每一位上统计该位的贡献。由于最后是两两异或的求和,所以二进制拆分后打乱不会影响结果。dp[i][j]表示第i位上数字为j的数量(因为用二进制算的,j只能为1或0),
又只有1^0=1,所以第i位贡献为dp[i][0] * dp[i][1] * (1ll << i)AC代码:
#include<bits/stdc++.h>
using namespace std;
using ll = long long;
const ll maxn = 1e18;
const int MOD = 998244353;
ll gcd(ll a, ll b) {
return b ? gcd(b, a % b) : a;
}
void solve() {
int n; cin >> n;
vector<ll>a(n + 1);
vector<ll>p(n + 1);
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= n; i++) {
p[i] = p[i - 1] ^ a[i];
}
ll dp[22][2] = { };
for (int i = 0; i <= n; i++) {
for (int j = 0; j <= 20; j++) {
dp[j][(p[i] >> j) & 1]++;
}
}
ll ans = 0;
for (int i = 0; i <= 20; i++) {
ans += dp[i][0] * dp[i][1] * (1ll << i);
}
cout << ans << '\n';
}
signed main() {
ios::sync_with_stdio(false);
cin.tie(0);
std::cout.tie(0);
int t1 = 1;
//cin >> t1;
while (t1--)
solve();
return 0;
}