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 | jiangly | 3898 |
2 | tourist | 3840 |
3 | orzdevinwang | 3706 |
4 | ksun48 | 3691 |
5 | jqdai0815 | 3682 |
6 | ecnerwala | 3525 |
7 | gamegame | 3477 |
8 | Benq | 3468 |
9 | Ormlis | 3381 |
10 | maroonrk | 3379 |
# | User | Contrib. |
---|---|---|
1 | cry | 168 |
2 | -is-this-fft- | 165 |
3 | Dominater069 | 161 |
4 | Um_nik | 160 |
5 | atcoder_official | 159 |
6 | djm03178 | 157 |
7 | adamant | 153 |
8 | luogu_official | 150 |
9 | awoo | 149 |
10 | TheScrasse | 146 |
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 |
---|