That explains it! Thanks for clearing up the confusion, Pablo. I forgot
that problem had shown up twice.
On Thu., Aug. 23, 2018, 10:30 'Pablo Heiber' via Google Code Jam, <
google-code@googlegroups.com> wrote:
> Part of the confusion is that the problem appeared in the 2017
> qualification round
I think you have misunderstood the analysis. To keep a reasonable complexity,
you need to make sure that your set cannot contain several times the same
element.
See the comment saying "This is a set, not a multiset!". Therefore, heapq will
not be the right datastructure for this, as it does not
The question statement says 30 secs.
https://codejam.withgoogle.com/2018/challenges/0130/dashboard/0652
--
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
On 08/23/2018 04:42 AM, Bartholomew Furrow wrote:
We're looking at roughly 10^6 heap operations in 100 test cases, which
is around 10^8 heap operations total. I'd expect that to run in 4
minutes or less in C++ no problem, but in Python I wouldn't be so
confident. How long does it run for?
I
Part of the confusion is that the problem appeared in the 2017
qualification round and in the 2018 practice round, and you can try to
practice in both of them. I would expect your code to reasonably solve the
2017 qualification round version.
For the 2018 practice round, it's possible that the
Are we talking about the qualification round problem from 2017? How are you
trying to solve it if not by downloading the data? All problems prior to
2018 are solved by downloading data and uploading output.
I do think the analysis is right.
On Thu., Aug. 23, 2018, 04:24 Eugene Yarmash, wrote:
