correction: ...guess *yours* is way more powerful...
On Monday, June 23, 2014 10:06:02 PM UTC+8, evandrix wrote:
> Hi,
>
> Yes, I can confirm now that it does indeed work as you've claimed.
>
> Although, these are the runs I did on my MacBook Air (almost idle), with the
> C++11 and -O2 switches
Hi,
Yes, I can confirm now that it does indeed work as you've claimed.
Although, these are the runs I did on my MacBook Air (almost idle), with the
C++11 and -O2 switches as you've recommended:
Run #1: ./D < D-large-practice.in 106.09s user 0.48s system 99% cpu 1:46.77
total
Run #2: ./D < D-l
Hi evandrix,
We have updated the sample implementation for problem D to not use STL map
thus it is now O(N^2).
It does take about 1 minute to run for the large input with -O2
optimization for C++11.
Felix Halim
On Fri, Jun 20, 2014 at 2:44 AM, evandrix wrote:
> Hi,
>
> The given solution in
Hi,
The given solution in the contest analysis/editorial for problem D, doesn't
seem to work, ie. it takes a very long time to come up with the solution for
the D-large-practice test input.
Is there any AC code available that will solve D-large?
Thanks
On Thursday, June 19, 2014 2:22:42 AM UT
