On 04/12, Carlitos wrote:
This is what I came up with, and the only different is that you
accumulate results into a list before coercing it back into a string --
I used MAP instead
That's very interesting, thank you. I've found that my code works if I call
(sb-ext:gc) before solving each case.
I guess the take-home message is to reduce consing as much as possible and to
call the garbage collector often just in case.
I run into something similar for problem 3 (it was RE-ing for the hidden
data-set), but instead of invoking the garbage collector I changed my
implementation from: read ciphertext as a string and then split it by
space, to call READ x times. I was lucky, but next time I am surely
going to remember about trying to GC instead.
Thank you,
Matteo
--
Matteo Landi
https://matteolandi.net
--
You received this message because you are subscribed to the Google Groups "Google
Code Jam" group.
To unsubscribe from this group and stop receiving emails from it, send an email
to [email protected].
To post to this group, send email to [email protected].
To view this discussion on the web visit
https://groups.google.com/d/msgid/google-code/20190414062930.GE2837%40hairstyle.local.
For more options, visit https://groups.google.com/d/optout.
