Harder version of today's Div.3C

Revision en1, by tyristik, 2024-07-26 21:27:52

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?

Tags harder, challenge

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en3 English tyristik 2024-07-26 21:31:43 17
en2 English tyristik 2024-07-26 21:28:38 1 Tiny change: 've ![today's C proble' -> 've ![todays C proble'
en1 English tyristik 2024-07-26 21:27:52 251 Initial revision (published)