Обсуждение @ 1414. Астрономическая база данных @ Timus Online Judge

Why this taks can not be solved with Trie? :@@

Послано Giorgi Pataraia [Tbilisi SU] 8 мар 2013 19:24

http://pastebin.com/Cr6m0rw7
I think I tried everything that can limit memory but still got MLE :/

Re: Why this taks can not be solved with Trie? :@@

Послано Andrew Sboev [USU] 8 мар 2013 19:58

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? :@@

Послано Giorgi Pataraia [Tbilisi SU] 9 мар 2013 03:41

thanks, now AC with set :/

Re: Why this taks can not be solved with Trie? :@@

Послано HUECTRUM 18 фев 2017 08:18

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? :@@

Послано Keworker `~ 28 июн 2024 18:19

Solved with C++ with tree of static arrays of links, without any STL structures

Обсуждение задачи 1414. Астрономическая база данных