[gcj] Round 1A 2012 - Problem B
Hi folks. I don't know how to count... xD The last test case of the sample, I'm counting 7 times, but it is showing 6. 0 5 , 5 0 1 - 1, 2 1 1, 3 4 7 , 4 , 7 5 6 , 6 Link for the problem: https://code.google.com/codejam/contest/1645485/dashboard#s=p1 Please, help me! =D -- 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/msg/google-code/-/XYL1ukR6SZQJ. For more options, visit https://groups.google.com/groups/opt_out.
[gcj] Re: Bull's Eye - Large
Hi,
I understand that they're using binary search, but I don't know how can it get
to the solution.
Could someone be very nice and explain the code below, please?
This is from coder wata:
void solve() {
long left = 0, right = 1L 40;
while (right - left 1) {
long n = (left + right) / 2;
if ((double)(2 * r + 1) * n + 2.0 * n * (n - 1) 1.5 * t) {
right = n;
} else if ((2 * r + 1) * n + 2 * n * (n - 1) t) {
right = n;
} else {
left = n;
}
}
System.out.println(left);
}
Why those values, why 1.5? Man, I don't understand this code :(
Em sábado, 27 de abril de 2013 05h42min58s UTC-3, Vaibhav Tulsyan escreveu:
I was seeing the solutions of the top 10 contestants for the large input of
Bull's Eye. They all seem to have used some method involving variables like
beginning,end and mid. Can anybody explain to me what method they've applied
exactly?
I just used basic maths to solve it. They seem to have used some better
algorithm.
--
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/msg/google-code/-/nB8pI_xLLzAJ.
For more options, visit https://groups.google.com/groups/opt_out.
[gcj] Re: Best Language for code jam
No, I don't. 2012 champion used Java. xD -- 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/msg/google-code/-/djzIIGead_gJ. For more options, visit https://groups.google.com/groups/opt_out.
[gcj] Commented Source Code together with Contest Analysis
Hi. Many times the Contest Analysis doesn't contain a working solution. I know that we can see the solutions from other coders, but many times is hard to understand their codes: no comments, variable's names ... It would help a lot if Code Jam provide us with a working solution with a lot of comments. I'm just asking this because they already have a solution for each problem (otherwise they would not select the problem). So no big deal, maybe just add more comments. =D Like Contest Analysis for Round 1A. They just provided the solution for the easier problem!!! :/ https://code.google.com/codejam/contest/2418487/dashboard#s=aa=2 Why not for Manage your Energy and Good Luck? Sad ... :( -- 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/msg/google-code/-/SERF43tR-J4J. For more options, visit https://groups.google.com/groups/opt_out.
[gcj] Top 25
I'm impressed that many favourites couldn’t make up to the finals: bmerry, meret, rng..58 I think Gennady.Korotkevich will win, but the others are strong too. It'll be exciting! =D -- 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/615a62f0-cb2c-4f5c-b5bd-7444ca2aceeb%40googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
[gcj] Re: Top 25
On Saturday, June 15, 2013 7:51:38 PM UTC-3, newbie007 wrote: I'm impressed that many favourites couldn’t make up to the finals: bmerry, meret, rng..58 I think Gennady.Korotkevich will win, but the others are strong too. It'll be exciting! =D Other interesting things are that China is not in the finals, and there's 3 from USA, tied with Poland, and only behind Russia with 8. -- 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/e43a9226-e69c-4949-86ac-2c36b2e1f6b2%40googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
[gcj] Why Gennady.Korotkevich didn't participate?
Gennady.Korotkevich was the favorite, but he didn't participate. Does someone know why? And big congrats to mystic!!! Thanks in advance. -- 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/6733157f-3474-46b5-9ec0-5e5020c73b3c%40googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
[gcj] Magic Trick problem mistake (?)
Hi, If in the second arrangement, the cards from the first chosen row are not all in different rows, then he IS a Bad magician! I know that the magician may be luck and still be able to find the card depending on the volunteer choices, but it doesn't change the fact that he IS a Bad magician! For me this is not a corner case. It is one thing that was not clear in the problem, so it should be covered in the sample cases. -- 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/44c1d60f-7972-4447-ab88-d22c3fe467fa%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
[gcj] Minesweeper backtracking approach
Hi, In the problem's analysis they mention the use of backtracking to solve the problem: https://code.google.com/codejam/contest/2974486/dashboard#s=aa=2 They also say that it's an easier approach, but maybe it's harder to validate if the configuration is valid than enumerate the corner cases? Does someone can show a solution for this problem implementing backtracking or point to some coder that implemented it? Thank you. -- 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/a32d4f30-9fc3-48f8-a6cc-02a3b2b79498%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
[gcj] Problem D Fashion Show
https://code.google.com/codejam/contest/3264486/dashboard#s=p3 [quote] ... x+o .+. The middle row has a pair of models (x and o) that does not include a +. [/quote] I didn't understand this part. The middle row HAS a + :( -- 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/f23951a1-9968-49a6-b3fe-b2400a61a863%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
[gcj] Parenting Partnering: Analysis
is 0 midnight? is 1440 midnight? why if C (0-720) and J(720-1440) is not only ONE exchange? I didn't understand sample case 3: 2 2 0 1 1439 1440 1438 1439 1 2 time taking care of the baby: James..: 0-1, 720-1438, 1439-1440 Cameron: 1-720, 1438-1439 I counted 4 exchanges! :/ -- 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/29642b75-2d92-4739-93bf-3ebfad7197f3%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
[gcj] array referenced in another array
Hi, Many coders use code like this: int q[N][N], ptr[N]; and then: q[i][ptr[i]] It was used a lot to solve Ratatouille https://code.google.com/codejam/contest/5304486/dashboard#s=p1=1 I am a newbie, but it seems like an efficient way to keep state(?) when do you use such approach? Thank you. -- 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/52d4c6d8-7198-4a02-9f9e-ff0875d18d5f%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
[gcj] The Qual Round is over!
Usually in the qualification round the first two problems are simple and with no tricks. I got A and B correct for the small data sets, so I assumed it was fine. But then wrong for A large and time exceed for B large. Oo Probably I was too careless, but I think CodeJam missed the qualification round purpose this year. -- 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/1c05cf0e-d772-4b96-879c-b61535bd9145%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
[gcj] A problem ocurred. try again later. But then the solutions appear in submissions
after some minutes the solutions are in submissions, even though it says a "problem occurred" -- 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/128da8e3-6fc4-4cc1-8fbc-99ae3b660974%40googlegroups.com. For more options, visit https://groups.google.com/d/optout.
