Xor Sum 3

AtCoder

IDabc141_f

Time2000ms

Memory256MB

Difficulty—

We have $N$ non-negative integers: $A_1, A_2, ..., A_N$. Consider painting at least one and at most $N-1$ integers among them in red, and painting the rest in blue. Let the _beauty_ of the painting be the $\text{XOR}$ of the integers painted in red, plus the $\text{XOR}$ of the integers painted in blue. Find the maximum possible beauty of the painting. What is $\text{XOR}$?The bitwise $\text{XOR}$ $x_1 \oplus x_2 \oplus \ldots \oplus x_n$ of $n$ non-negative integers $x_1, x_2, \ldots, x_n$ is defined as follows: * When $x_1 \oplus x_2 \oplus \ldots \oplus x_n$ is written in base two, the digit in the $2^k$'s place ($k \geq 0$) is $1$ if the number of integers among $x_1, x_2, \ldots, x_n$ whose binary representations have $1$ in the $2^k$'s place is odd, and $0$ if that count is even. For example, $3 \oplus 5 = 6$. ## Constraints * All values in input are integers. * $2 \leq N \leq 10^5$ * $0 \leq A_i < 2^{60}\ (1 \leq i \leq N)$ ## Input Input is given from Standard Input in the following format: $N$ $A_1$ $A_2$ $...$ $A_N$ [samples]

Samples

Input #1

3
3 6 5

Output #1

12

If we paint $3$, $6$, $5$ in blue, red, blue, respectively, the beauty will be $(6) + (3 \oplus 5) = 12$.
There is no way to paint the integers resulting in greater beauty than $12$, so the answer is $12$.

Input #2

4
23 36 66 65

Output #2

Input #3

20
1008288677408720767 539403903321871999 1044301017184589821 215886900497862655 504277496111605629 972104334925272829 792625803473366909 972333547668684797 467386965442856573 755861732751878143 1151846447448561405 467257771752201853 683930041385277311 432010719984459389 319104378117934975 611451291444233983 647509226592964607 251832107792119421 827811265410084479 864032478037725181

Output #3

2012721721873704572

$A_i$ and the answer may not fit into a $32$\-bit integer type.

API Response (JSON)

{
  "problem": {
    "name": "Xor Sum 3",
    "description": {
      "content": "We have $N$ non-negative integers: $A_1, A_2, ..., A_N$. Consider painting at least one and at most $N-1$ integers among them in red, and painting the rest in blue. Let the _beauty_ of the painting be",
      "description_type": "Markdown"
    },
    "platform": "AtCoder",
    "limit": {
      "time_limit": 2000,
      "memory_limit": 262144
    },
    "difficulty": "None",
    "is_remote": true,
    "is_sync": true,
    "sync_url": null,
    "sign": "abc141_f"
  },
  "statements": [
    {
      "statement_type": "Markdown",
      "content": "We have $N$ non-negative integers: $A_1, A_2, ..., A_N$.\nConsider painting at least one and at most $N-1$ integers among them in red, and painting the rest in blue.\nLet the _beauty_ of the painting be...",
      "is_translate": false,
      "language": "English"
    }
  ]
}

Full JSON Raw Segments