Discussion @ 1269. Obscene Words Filter @ Timus Online Judge

How did people solve this problem within 0.1 s?

Posted by Peng Kejing 7 Feb 2009 08:34

Besides using Aho-Karasik, is there any other way to solve this problem?
How did people solve this problem within 0.1 s? My Aho-Karasik Algorithm used 0.5 s, too slow.

Re: How did people solve this problem within 0.1 s?

Posted by Leonid (SLenik) Andrievskiy 11 Jul 2009 01:24

Maybe it was a suffix tree?

Edited by author 11.07.2009 01:25

Discussion of Problem 1269. Obscene Words Filter