|
|
back to boardWhy this taks can not be solved with Trie? :@@ Re: Why this taks can not be solved with Trie? :@@ It's just brute-force task :) There 36 lines in my AC code versus yours 165 lines :) Edited by author 08.03.2013 19:59 Re: Why this taks can not be solved with Trie? :@@ thanks, now AC with set :/ Re: Why this taks can not be solved with Trie? :@@ It can actually be solved with trie. My solution uses 0.4s (cin) and 20MB. Just store a map in every node. Re: Why this taks can not be solved with Trie? :@@ Solved with C++ with tree of static arrays of links, without any STL structures |
|
|