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.
# | User | Rating |
---|---|---|
1 | tourist | 3757 |
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 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 171 |
2 | awoo | 165 |
3 | adamant | 164 |
4 | TheScrasse | 159 |
5 | maroonrk | 155 |
6 | nor | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Xor subarray less than k in every query
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.
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en4 | YoyOyoYOy000y000 | 2020-02-02 17:04:06 | 6 | Tiny change: 'be solved with persisten' -> 'be solved by persisten' | ||
en3 | YoyOyoYOy000y000 | 2020-02-02 10:53:45 | 31 | Tiny change: 'q query.\n\nIn ev' -> 'q query.\nq and n all less than 100000.\n\nIn ev' | ||
en2 | YoyOyoYOy000y000 | 2020-02-02 10:52:34 | 4 | Tiny change: 'han k?\n\n## I think i' -> 'han k?\n\n** I think i' | ||
en1 | YoyOyoYOy000y000 | 2020-02-02 10:52:08 | 240 | Initial revision (published) |
Name |
---|