异或——Red Scarf

最新推荐文章于 2024-12-26 12:36:50 发布

蕉乐狼

最新推荐文章于 2024-12-26 12:36:50 发布

阅读量367

点赞数

本文链接：https://blog.csdn.net/xyqshy999/article/details/106922786

版权

这是一道编程题，描述了有一群Snuke猫，每只猫脖子上的红围巾上写着它们喜欢的非负整数。已知除了自己以外的所有猫的数字异或值，目标是恢复所有猫围巾上的原始数字。通过异或运算的性质，由于猫的数量是偶数，可以推导出所有数字异或后等于一个常数X，然后逐个计算出每个猫的原始数字。

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

Red Scarf

$\color{blue}Problem Statement$
There are $N$ Snuke Cats numbered $1, 2, \dots, N$ , where $N$ is even.

Each Snuke Cat wears a red scarf, on which his favorite non-negative integer is written.

Recently, they learned the operation called xor (exclusive OR).

We know that the xor calculated by Snuke Cat i, that is, the xor of the integers written on the scarfs except the scarf of Snuke Cat i is ai
. Using this information, restore the integer written on the scarf of each Snuke Cat.

$\color{blue}Constraints$
All values in input are integers. $2 \leq N \leq 200000$ , $N$ is even. $0≤a_i≤10^9$
There exists a combination of integers on the scarfs that is consistent with the given information.

$\color{blue}Input$
Input is given from Standard Input in the following format:

N
a1 
a2 
… 
aN

$\color{blue}Output$
Print a line containing $N$ integers separated with space.
The i-th of the integers from the left should represent the integer written on the scarf of Snuke Cat i.
If there are multiple possible solutions, you may print any of them.

根据题目意思和样例解释，我们可以得到以下式子：
设 $a_i$ 为题目给出的， $b_i$ 为答案
$a_1=b_2 \oplus b_3 \oplus b_4 \oplus ...b_n$
$a_2=b_1 \oplus b_3 \oplus b_4 \oplus ...b_n$
$. . .$
$a_n=b_1 \oplus b_2 \oplus b_3 \oplus ... b_{n-1}$
因为 $n$ 是个偶数，所以根据上面的式子，易得：
$a_1 \oplus a_2 \oplus a_3..\oplus a_n = b_1 \oplus b_2 \oplus b_3 ....\oplus b_n$
我们设它等于 $X$
因为 $a_1=b_2 \oplus b_3 \oplus b_4 \oplus ...b_n$ ，再根据 $\oplus a=0$ ， $\oplus a=a$ ，所以可以得到 $a_1=X \oplus b_1$ ，也就是 $b_1=a_1 \oplus X$ 。
同理可得， $b_i=X \oplus a_i$ 。

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 2e5 + 10;
const int INF = 0x3f3f3f3f;
const double eps = 1e-7;
#define endl '\n'
#define pb(a) push_back(a)
#define ALL(x) x.begin(), x.end()
#define SIZE(x) int(x.size())
#define IOS ios::sync_with_stdio(0);

int n;
int a[N],b[N];
int main() {
	scanf("%d",&n);
	int x=0;
	for(int i=1;i<=n;++i) scanf("%d",&a[i]),x^=a[i];
	for(int i=1;i<=n;++i) {
		b[i] = x^a[i];
	}
	for(int i=1;i<=n;++i) printf("%d ",b[i]);
	return 0;
}