you will be given an array. and q query. q and n all less than 100000.
In every query you will be given a k. how many subarray xor less than k?
** I think it can be solved by persistent trie. but i need another solution.
you will be given an array. and q query. q and n all less than 100000.
In every query you will be given a k. how many subarray xor less than k?
** I think it can be solved by persistent trie. but i need another solution.
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 4 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
Lets rephrase the problem a little bit. Denote by P[i] the XOR of numbers a[1], a[2], ..., a[i]. Now the XOR of subarray [L, R] becomes P[R] XOR P[L — 1] and the problem boils down to finding how many pairs of numbers from a list, when XOR-ed give a number less than K. This problem can be solved in O(NlogN) with the help of the Walsh-Hadamard transform and you can get some insight for the implementation from here: https://csacademy.com/blog/fast-fourier-transform-and-variations-of-it
i only know fast walsh hadamard gives us... all pairs xor/and/or sum. i don't know about this variation. Thanks.