[gcj] Re: Messages in Polish in parunner.exe
On Wednesday, June 10, 2015 at 4:17:38 AM UTC+8, Stanislav Zholnin wrote: Hi, Is it intended behavior that parunner.exe at some point prints messages in Polish? I am trying to use -trace_comm=true to see things like: czekam na wiadomość od instancji. It is similar enough to Russian for me to have any problems, but might be different for other contestants. Yes, I've raised a request to the author, and it's been partially resolved here: https://github.com/robryk/parunner/issues/4 Google Translate does pretty well in the interim, I must say. -- 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 google-code+unsubscr...@googlegroups.com. To post to this group, send email to google-code@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/df1f5f71-abf2-47be-9dfc-6fdb93cd284b%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
Re: [gcj] Re: Contest analysis for GCJ 2014 Round 3
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-large-practice.in 104.79s user 0.48s system 99% cpu 1:45.29 total It does take ~1m40s on my local machine, guess you're is way more powerful then (but anything under 8m should pass in a real contest). Thanks, Lee Wei On Monday, June 23, 2014 11:13:22 AM UTC+8, Felix Halim wrote: 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 evan...@gmail.com wrote: 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 UTC+8, Topraj Gurung wrote: Hi all, The contest analysis for GCJ 2014 Round 3 is available at: https://code.google.com/codejam/contest/3024486/dashboard#s=a Thanks, Topraj, for the Code Jam team. -- 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 google-code...@googlegroups.com. To post to this group, send email to googl...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/6bb34c6e-a3bb-4332-8454-43a2eea1bbfa%40googlegroups.com. For more options, visit https://groups.google.com/d/optout. -- 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 google-code+unsubscr...@googlegroups.com. To post to this group, send email to google-code@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/bf0e3fd2-2059-4549-93e0-a499bcd0ece9%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
Re: [gcj] Re: Contest analysis for GCJ 2014 Round 3
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 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-large-practice.in 104.79s user 0.48s system 99% cpu 1:45.29 total It does take ~1m40s on my local machine, guess you're is way more powerful then (but anything under 8m should pass in a real contest). Thanks, Lee Wei On Monday, June 23, 2014 11:13:22 AM UTC+8, Felix Halim wrote: 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 evan...@gmail.com wrote: 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 UTC+8, Topraj Gurung wrote: Hi all, The contest analysis for GCJ 2014 Round 3 is available at: https://code.google.com/codejam/contest/3024486/dashboard#s=a Thanks, Topraj, for the Code Jam team. -- 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 google-code...@googlegroups.com. To post to this group, send email to googl...@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/6bb34c6e-a3bb-4332-8454-43a2eea1bbfa%40googlegroups.com. For more options, visit https://groups.google.com/d/optout. -- 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 google-code+unsubscr...@googlegroups.com. To post to this group, send email to google-code@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/07828597-f96c-4c61-b9dd-59200d291741%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
[gcj] Re: Round 3, Problem A. Binary search really necessary for O(n) solution?
Hi, I tried to run your solution through (using PyPy 2.3.1) A-large-practice, and received the WA judgment on your output using that code. Is it meant to produce AC code through A-large-practice.in? Lee Wei On Sunday, June 22, 2014 12:09:54 AM UTC+8, Eibe wrote: I just read the analysis for problem A of round 3 and it is mentioned that binary search is necessary for an O(n) solution. I don't think it is but maybe something with my thinking is wrong (I don't have a strict proof of correctness of the following): Let ts be a list, where ts[i] is the numbers of transistors in device i. Start with the following partition left, middle, right = [], ts, [] Now repeatedly move either the leftmost element of middle into left or the rightmost element of middle into right in a way that increases max(sum(left), sum(right)) in the least possible way. That is if sum(left) + middle[0] sum(right) + middle[-1] move the leftmost otherwise the rightmost element (middle[-1] denotes the rightmost element of middle). I am a little sloppy here, but as we increase max(sum(left), sum(right)) by a minimal amount it feels that we will visit an optimal partition of ts eventually. In python code: T = int(raw_input()) for case in range(1, T+1): N, p, q, r, s = map(int, raw_input().split()) ts = [(i*p+q)%r+s for i in range(N)] c0, c1, c2 = 0, sum(ts), 0 a, b = 0, N solveig = sum(ts) while a b: if c0 + ts[a] = c2 + ts[b-1]: c0 += ts[a] c1 -= ts[a] a += 1 else: c2 += ts[b-1] c1 -= ts[b-1] b -= 1 solveig = min(solveig, max(c0, c1, c2)) res = 1 - solveig / sum(ts) print Case #%i: %.10f %(case, res) -- 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 google-code+unsubscr...@googlegroups.com. To post to this group, send email to google-code@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/869face2-2cb2-43c2-ab5c-b2555f010dad%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
[gcj] Re: Contest analysis for GCJ 2014 Round 3
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 UTC+8, Topraj Gurung wrote: Hi all, The contest analysis for GCJ 2014 Round 3 is available at: https://code.google.com/codejam/contest/3024486/dashboard#s=a Thanks, Topraj, for the Code Jam team. -- 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 google-code+unsubscr...@googlegroups.com. To post to this group, send email to google-code@googlegroups.com. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/6bb34c6e-a3bb-4332-8454-43a2eea1bbfa%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
