Hi Felix
Can you please help me in understanding how to solve the Square Field problem
from 2008 practice contest.
Problem Link - https://code.google.com/codejam/contest/32004/dashboard#s=p1
Sujit
--
You received this message because you are subscribed to the Google Groups
Google Code Jam
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
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 as
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 evand...@gmail.com wrote:
Hi,
The
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
On Friday, May 3, 2013 11:34:48 PM UTC+5:30, Bjarki Ágúst Guðmundsson wrote:
Why is the O(1) solution to Problem A (Bullseye) not presented in the Contest
Analysis?
Please share the code.
--
You received this message because you are subscribed to the Google Groups
Google Code Jam group.
To
@San
Here is my solution which is O(1)
http://0xdeafc0de.wordpress.com/2013/04/30/gcj-2013-r1a-bullseye-o1-solution/
- Madura A.
On Sat, May 4, 2013 at 4:54 PM, Sann shuklasannid...@gmail.com wrote:
On Friday, May 3, 2013 11:34:48 PM UTC+5:30, Bjarki Ágúst Guðmundsson
wrote:
Correct me if I am wrong, but
The answer to your question is given by yourself, it relies on the arbitrary
precision arithmetic of Decimal module of python, which is doing all the work.
and infact your solution is slower than the one given in the analysis. The
given solution works in
True, someone asked the same problem on the blog, here's my reply to him,
True enough, I’ve assumed sqrt() to be O(1) which is comparatively correct
because other operations take a lot of time comparatively. I do not change
precision while running its changed only once, all other operations are
I also ran the given solution after converting it to python 3, here are the
results
[madura@trex-j ~]$ time python3 g.py Downloads/A-large-practice.in
/dev/null
real0m1.952s
user0m1.927s
sys 0m0.023s
- Madura A.
On Sat, May 4, 2013 at 7:26 PM, Madura Anushanga
On Tuesday, April 30, 2013 12:16:55 AM UTC, Bartholomew Furrow wrote:
You can find the analysis at
https://code.google.com/codejam/contest/2418487/dashboard#s=a. Enjoy!
Bartholomew
Why is the O(1) solution to Problem A (Bullseye) not presented in the Contest
Analysis?
That is, let the
Can someone explain the binary tree part of the O(NlogN) solution for
problem B to me? Why do we need a binary search tree here? The purpose of
the tree is to help find the nearest activity or find out the limits? I
understand the solution in this way: we need to find the nearest activity
that has
I used that O(N log N) strategy for my solution (though I got the large
input wrong because I did not check for RE, sigh), so let me explain how
my solution worked:
First, make a copy of all the activity values with their original indexes
attached, and sort these in descending order. This is the
Thanks you a lot.
As usual in my case (and I think it is more or less true for everybody),
analysis of problems I solved seems to be much more complicated than my
solution, while analysis of problems I didn't solve seems to be superficial and
not detailed enough to easily grasp :) Oh, human
I did it by using a regular expression to find a node in the tree
which is one level higher than a leaf node
i.e. ( 0.5 ) is a leaf node
( 0.5 fluffy (1.0) (0.25) ) is the next simplest tree node. The key
to identifying this tree is the ( () () ) pattern of brackets.
I then used string
HI,
I am not able to understand the solution for Problem C in Round 1B .
Can anybody simplify the solution a little bit.
On Sep 15, 9:00 am, benetin gou...@gmail.com wrote:
Enjoy.
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the
A minor glitch in 1C-C: // Start the computation. int r = 0;
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to this group, send email to google-code@googlegroups.com
To unsubscribe
Anything to 7 decimal places is still within a precision of 10^-6, so
the analysis is correct, and it won't be a typo. It is common to allow
for much higher precision than asked for just in case you had an off-
by-one error somewhere.
On Sep 15, 9:01 pm, Matteo Landi landima...@gmail.com wrote:
Ok, i thought the checker would validate only results with that
precision. My fault!
On Tue, Sep 15, 2009 at 12:54 PM, TripleM stephenmerri...@gmail.com wrote:
Anything to 7 decimal places is still within a precision of 10^-6, so
the analysis is correct, and it won't be a typo. It is common
Google Code Jam allows standard scientific notations also, doesn't
it? The grader is fairly sophisticated. You usually don't need to
worry about decimal format unless it's the point of the problem.
-Brian
On Sep 15, 5:54 am, TripleM stephenmerri...@gmail.com wrote:
Anything to 7 decimal
Relating to the contest analysis for Decision Tree:
The hard part here was parsing the tree. The easiest way to do this is by
using a technique called recursive descent.
In (especially, but certainly not limited to) dynamic languages,
there's an even easier technique, which is to use regular
Guess we should provide the links.:)
1A: http://code.google.com/codejam/contest/dashboard?c=188266#s=a
1B: http://code.google.com/codejam/contest/dashboard?c=186264#s=a
1C: http://code.google.com/codejam/contest/dashboard?c=189252#s=a
On Sep 15, 12:00 am, benetin gou...@gmail.com wrote:
Enjoy.
They're out already.
On Sep 13, 5:29 pm, Nikhil Mahajan nikhil...@gmail.com wrote:
When do the solutions for Rounds 1A/B/C come out?
--~--~-~--~~~---~--~~
You received this message because you are subscribed to the Google Groups
google-codejam group.
To post to
To clarify: the contest analyses by Google are *not* out yet. Downloading
of other people's submissions, however, became available the second the
contest ended.
On Sun, Sep 13, 2009 at 3:18 PM, Ferriludian cornelius.perk...@gmail.comwrote:
They're out already.
On Sep 13, 5:29 pm, Nikhil
24 matches
Mail list logo
