|
|
back to boardNow I am at Bottom with 3 cec. The top has 0.25 cek. Now it's difficult to imagine what technicue they used. Edited by author 04.07.2007 14:39 Edited by author 04.07.2007 14:40 I got AC in 0.453, using Hash method. I think that's faster then sorting + binary search, because i got TLE with this metod. Hashes are faster and more easy to implement (for me..) I got 0.281 with characters tree on requests. And just 4Mb as well :) |
|
|