ENG  RUSTimus Online Judge
Online Judge
Problems
Authors
Online contests
About Online Judge
Frequently asked questions
Site news
Webboard
Links
Problem set
Submit solution
Judge status
Guide
Register
Update your info
Authors ranklist
Current contest
Scheduled contests
Past contests
Rules
back to board

Discussion of Problem 1269. Obscene Words Filter

Why WA at test 2
Posted by SPIRiT 25 Sep 2006 11:55
I used Aho-Corasic algo but got WA, although expected TLE :). Anything special about this test?
By the way, can I use arrays instead of lists of edges? According to the statement word can have 253 different values. How many vertices can there be?

Edited by author 25.09.2006 13:01
Re: Why WA at test 2
Posted by Denis Koshman 25 Aug 2008 19:02
~100k vertices according to dictionary size