假设 ∀ a \forall a ∀a, b b b,枚举 a a a & \& & b b b 的第 i i i 位的数字
i f if if a [ i ] = 0 a[i] = 0 a[i]=0, b [ i ] = 0 b[i] = 0 b[i]=0, 0 + 0 = 0 0+0=0 0+0=0, 0 0 0 ^ \text{\textasciicircum} ^ 0 = 0 0=0 0=0
i f if if a [ i ] = 0 a[i] = 0 a[i]=0, b [ i ] = 1 b[i] = 1 b[i]=1, 0 + 1 = 1 0+1=1 0+1=1, 0 0 0 ^ \text{\textasciicircum} ^ 1 = 1 1=1 1=1
i f if if a [ i ] = 1 a[i] = 1 a[i]=1, b [ i ] = 0 b[i] = 0 b[i]=0, 1 + 0 = 0 1+0=0 1+0=0, 1 1 1 ^ \text{\textasciicircum} ^ 0 = 1 0=1 0=1
i f if if a [ i ] = 1 a[i] = 1 a[i]=1, b [ i ] = 1 b[i] = 1 b[i]=1, 1 + 1 = 2 1+1=2 1+1=2, 1 1 1 ^ \text{\textasciicircum} ^ 1 = 0 1=0 1=0
⟹ a [ i ] \implies a[i] ⟹a[i] ^ \text{\textasciicircum} ^ b [ i ] b[i] b[i] ≤ \leq ≤ a [ i ] + b [ i ] a[i]+b[i] a[i]+b[i]
所以分成 1 1 1组, s u m sum sum就是最小
#include<bits/stdc++.h>
#define ll long long
using namespace std;
inline int read(){
int x = 0; bool f = false; char ch = getchar();
while(!isdigit(ch)){if(ch == '-') f = true; ch = getchar();}
while(isdigit(ch)){x = x * 10 + ch - '0'; ch = getchar();}
return f ? -x : x;
}
inline void write(ll x){
if (x < 0) x = ~x + 1, putchar('-');
if (x > 9) write(x / 10);
putchar(x % 10 + '0');
}
int n, ans;
int main(){
n = read();
for(register int i = 0; i < n; ++i) ans ^= read();
write(ans);
puts("");
return 0;
}
I M P E R I S H A B L E \mathbb{IMPERISHABLE} IMPERISHABLE N I G H T \mathbb{NIGHT} NIGHT
神灵庙里永夜抄,全人类的绯想天。 风神录完文花帖,心怀一个萃梦想。 早日来到地灵殿,睡觉做个妖妖梦。 忽闻群中天邪鬼,企图挑起大战争。 明早埋下红魔乡,爆发翻成辉针城。 心绮楼中老司机,远道驾来星莲船。 飘遥恍若茨歌仙,字字求闻口授篇。 “明日务归花映冢!怠慢则入绀珠传!” 哗然立静无人言,深秘录记此奇事。