How to solve today's C problem if alphabet is not $$$26$$$ characters but rather $$$O(n)$$$? I could only come up with simple $$$O(q \sqrt n)$$$ using basic MO algorithm. Any ideas?
Harder version of today's Div.3C
How to solve today's C problem if alphabet is not $$$26$$$ characters but rather $$$O(n)$$$? I could only come up with simple $$$O(q \sqrt n)$$$ using basic MO algorithm. Any ideas?
| # | User | Rating |
|---|---|---|
| 1 | jiangly | 3846 |
| 2 | tourist | 3799 |
| 3 | orzdevinwang | 3706 |
| 4 | jqdai0815 | 3682 |
| 5 | ksun48 | 3590 |
| 6 | Ormlis | 3533 |
| 7 | Benq | 3468 |
| 8 | Radewoosh | 3463 |
| 9 | ecnerwala | 3451 |
| 9 | Um_nik | 3451 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 165 |
| 2 | -is-this-fft- | 161 |
| 3 | Qingyu | 160 |
| 4 | atcoder_official | 157 |
| 5 | Dominater069 | 156 |
| 6 | adamant | 154 |
| 7 | Um_nik | 151 |
| 7 | djm03178 | 151 |
| 9 | luogu_official | 149 |
| 10 | awoo | 147 |
