The tutorial of the problem 1322B - Present says "Bonus:Solve the problem in O(NlogC)." Can someone please explain how to do it?
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 156 |
7 | djm03178 | 152 |
7 | adamant | 152 |
9 | luogu_official | 150 |
10 | awoo | 147 |
The tutorial of the problem 1322B - Present 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