QOJ.ac

QOJ

Límite de tiempo: 1.5 s Límite de memoria: 1024 MB Puntuación total: 100

#4718. 异或和

Estadísticas

给定一个包含 $N$ 个整数的数组 $V_1, V_2, \dots, V_N$。

你的任务是求出 $\text{XOR}_{1 \le i \le j \le N} (V_i + V_j)$ 的结果。

输入格式

第一行包含一个整数 $N$,表示数组的大小。第二行包含 $N$ 个用空格分隔的整数 $V_1, V_2, \dots, V_N$。

输出格式

第一行包含所需的答案。

子任务

子任务 数据范围 分值
子任务 1 $1 \le N \le 4 \times 10^3, 1 \le V_i \le 5 \times 10^8$ 7 分
子任务 2 $1 \le N \le 10^6, 1 \le V_i \le 4 \times 10^3$ 11 分
子任务 3 $1 \le N \le 10^6, 1 \le V_i \le 10^6$ 21 分
子任务 4 $1 \le N \le 10^5, 1 \le V_i \le 5 \times 10^8$ 38 分
子任务 5 $1 \le N \le 10^6, 1 \le V_i \le 5 \times 10^8$ 23 分

样例

输入 1

4
3 9 6 6

输出 1

20

说明

$(1, 1) : 3 + 3 = 6$ $(1, 2) : 3 + 9 = 12$ $(1, 3) : 3 + 6 = 9$ $(1, 4) : 3 + 6 = 9$ $(2, 2) : 9 + 9 = 18$ $(2, 3) : 9 + 6 = 15$ $(2, 4) : 9 + 6 = 15$ $(3, 3) : 6 + 6 = 12$ $(3, 4) : 6 + 6 = 12$ $(4, 4) : 6 + 6 = 12$ $6 \oplus 12 \oplus 9 \oplus 9 \oplus 18 \oplus 15 \oplus 15 \oplus 12 \oplus 12 \oplus 12 = 20$

Editorials

IDTypeStatusTitlePosted ByLast UpdatedActions
EditorialOpen Official EditorialQingyu- Download

Discussions

About Discussions

The discussion section is only for posting: General Discussions (problem-solving strategies, alternative approaches), and Off-topic conversations.

This is NOT for reporting issues! If you want to report bugs or errors, please use the Issues section below.

Open Discussions 0
No discussions in this category.

Issues

About Issues

If you find any issues with the problem (statement, scoring, time/memory limits, test cases, etc.), you may submit an issue here. A problem moderator will review your issue.

Guidelines:

  1. This is not a place to publish discussions, editorials, or requests to debug your code. Issues are only visible to you and problem moderators.
  2. Do not submit duplicated issues.
  3. Issues must be filed in English or Chinese only.
Active Issues 0
No issues in this category.
Closed/Resolved Issues 0
No issues in this category.