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 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
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.
Название |
---|
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.