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 with persistent trie. but i need another solution.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3857 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3463 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 161 |
3 | Qingyu | 160 |
4 | Dominater069 | 159 |
5 | atcoder_official | 157 |
6 | adamant | 153 |
7 | Um_nik | 152 |
8 | djm03178 | 151 |
9 | luogu_official | 150 |
10 | awoo | 147 |
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 with persistent trie. but i need another solution.
Rev. | Язык | Кто | Когда | Δ | Комментарий | |
---|---|---|---|---|---|---|
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) |
Название |
---|