| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 157 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
[Help] Divide an array into two subsequences such that the sum of their xor sums is maximum
I'm trying to solve this problem 103708A - Anya's gifts, in more detail, we need to do this.
Given an array $$$A$$$ of length $$$n$$$ ($$$n \leq 10^5$$$, $$$a_i < 2^{50}$$$), divide it into two subsequences $$$X$$$ and $$$Y$$$ such that $$$x_1 \oplus$$$
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en4 |
|
SuperSheep | 2023-01-24 04:58:37 | 88 | ||
| en3 |
|
SuperSheep | 2023-01-23 21:40:08 | 13 | Tiny change: 'that $a_i & 2^p = 2^p' -> 'that $a_i and 2^p = 2^p' (published) | |
| en2 |
|
SuperSheep | 2023-01-23 21:32:25 | 423 | Tiny change: 'x_1 \oplus$' -> 'x_1 \oplus x_2 \oplus ... \oplus x_{|X|}$' | |
| en1 |
|
SuperSheep | 2023-01-23 20:56:45 | 314 | Initial revision (saved to drafts) |
