Блог пользователя Fork512Hz

Автор Fork512Hz, история, 4 недели назад, По-английски

I implemented the solution described in the editorial, with KMP instead of Z-function, but all my submissions ended up TLE41 (261016696) and I couldn't get the log^2 solution right.

By dividing the submission into $$$>\sqrt{n}$$$ and $$$\le\sqrt{n}$$$ parts I found my solution would finish in 3.2 seconds and I tried my best to squeeze in but still couldn't.

Could anyone help me optimize the constant factor further, or is KMP unable to pass?

  • Проголосовать: нравится
  • +1
  • Проголосовать: не нравится

»
4 недели назад, # |
  Проголосовать: нравится +4 Проголосовать: не нравится

My KMP passed by memoising it 260210442

»
4 недели назад, # |
  Проголосовать: нравится 0 Проголосовать: не нравится

OK. To recover from this I went to learn Aho-Corasick Automaton this evening and it went out pretty funny, 25/26 test cases passed on the template.