Hi, Notice that the inputs for test runs and real submissions are different, so it's not unlikely to obtain different results. Additionally, the time limit might be different (test runs have a 10 second time limit at present, while real runs depend on the problem), which can also lead to different outcomes, especially for problems imported from our previous system which tend to have higher time limits.
Hope this helps. Best, Pablo On Fri, Feb 15, 2019 at 12:18 PM Guessing <[email protected]> wrote: > I had every test fail but when I submit the code, I get 2 green V saying I > solved both the small and large data set. Tried writing google about it and > they kind of ignored it and just sent me to the FAQ. > Is this what you have been experiencing? > > > On Tuesday, February 12, 2019 at 10:44:26 PM UTC+1, Ionelia Buzatu wrote: > > Why it says "WA test case skipped" when I runt it? It's fine on my > machine. Am I not parsing the input correctly? What's wrong here? > > > > this is from 2018 Burger Optimization exercises. It gives me the same > error for all exercises. > > > > > > from itertools import permutations > > > > def burger(): > > output = {} > > for repeat in range(1, int(input())+ 1): > > ingredients = int(input()) > > distance_ingredients = [int(x) for x in input().split()] > > totpermutations = permutations(distance_ingredients) > > value = 999999 > > if len(distance_ingredients) > 4: > > for distance in totpermutations: > > value = min(value, (distance[0] - 0) ** 2 + (distance[1] > - 1) ** 2 + sum( > > [(i - 2) ** 2 for i in distance[2:-2]]) + > (distance[-2] - 1) ** 2 + (distance[-1] - 0) ** 2) > > if len(distance_ingredients) == 4: > > for distance in totpermutations: > > value = min(value, (distance[0] - 0) ** 2 + (distance[1] > - 1) ** 2 + (distance[-2] - 1) ** 2 + ( > > distance[-1] - 0) ** 2) > > if len(distance_ingredients) == 3: > > for distance in totpermutations: > > value = min(value, (distance[0] - 0) ** 2 + (distance[1] > - 1) ** 2 + (distance[-1] - 0) ** 2) > > if len(distance_ingredients) == 2: > > for distance in totpermutations: > > value = min(value, (distance[0] - 0) ** 2 + (distance[1] > - 1) ** 2) > > if len(distance_ingredients) == 1: > > for distance in totpermutations: > > value = min(value, (distance[0] - 0) ** 2) > > output[repeat] = "Case #{}: {}".format(repeat, value) > > # print("Case #{}: {}".format(repeat, value)) > > return "\n".join(output.values()) > > > > # print(burger()) > > -- > 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 [email protected]. > To post to this group, send email to [email protected]. > To view this discussion on the web visit > https://groups.google.com/d/msgid/google-code/2931a629-fafb-453e-9a02-171b68af6dff%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 [email protected]. To post to this group, send email to [email protected]. To view this discussion on the web visit https://groups.google.com/d/msgid/google-code/CANa5jcB6ATRgK1e4QeYQAWpk4-fGbG%2BQh7h9%2BFRdO%3D35RSi8tA%40mail.gmail.com. For more options, visit https://groups.google.com/d/optout.
