The tutorial of the problem 1322B - Подарок says "Bonus:Solve the problem in O(NlogC)." Can someone please explain how to do it?
# | User | Rating |
---|---|---|
1 | tourist | 3985 |
2 | jiangly | 3814 |
3 | jqdai0815 | 3682 |
4 | Benq | 3529 |
5 | orzdevinwang | 3526 |
6 | ksun48 | 3517 |
7 | Radewoosh | 3410 |
8 | hos.lyric | 3399 |
9 | ecnerwala | 3392 |
9 | Um_nik | 3392 |
# | User | Contrib. |
---|---|---|
1 | cry | 169 |
2 | maomao90 | 162 |
2 | Um_nik | 162 |
4 | atcoder_official | 161 |
5 | djm03178 | 158 |
6 | -is-this-fft- | 157 |
7 | adamant | 155 |
8 | awoo | 154 |
8 | Dominater069 | 154 |
10 | luogu_official | 151 |
The tutorial of the problem 1322B - Подарок says "Bonus:Solve the problem in O(NlogC)." Can someone please explain how to do it?
Name |
---|
Instead of $$$\log(C)$$$ "normal" sorts, you can use only one radix sort: for each step, the numbers modulo $$$2^{i+1}$$$ are sorted and you can use two pointers to get the $$$i$$$-th bit of the answer.
Using radix sort and two pointers 77988238