Discussion @ 1269. Obscene Words Filter @ Timus Online Judge

How to avoid ML if use Aho-Karasik?

Posted by BAron 6 Aug 2007 19:34

Key-Word-Tree have > 10000 tops(вершин). Every tops have children(all char(256))=> memory>256*10000 of int>8 mb!
How????
Please help!!!

P.S. Sorry for my bad english

Edited by author 11.08.2007 14:13

Re: How to avoid ML if use Aho-Karasik?

Posted by {AESC USU} Dembel 15 Aug 2007 19:38

юзай сжатый бор

Re: How to avoid ML if use Aho-Karasik?

Posted by SPIRiT 23 Jun 2008 12:54

Since you have only 10000 vertices, you can use short int for children links, and then you will fit into 8 Mb

Re: How to avoid ML if use Aho-Karasik?

Posted by Alex Tolstov 2 Jul 2009 17:45

>>юзай сжатый бор

how 'sjatiy bor' can help?

Re: How to avoid ML if use Aho-Karasik?

Posted by svr 2 Jul 2009 21:13

I got Ac without sjati bor

Discussion of Problem 1269. Obscene Words Filter