Rating changes for last rounds are temporarily rolled back. They will be returned soon. ×

anveshi's blog

Google Code Jam World Finals 2017
By anveshi, history, 9 years ago, In English

Google Code Jam World Finals 2017 just started. Here are some relevant links:

  1. Live Stream
  2. Problemset
  3. Score Board

Good luck to the participants:)!

Update: Contest is over. Contest Analysis

Final Standing
  • Vote: I like it
  • +101
  • Vote: I do not like it

»
9 years ago, hide # |
 
Vote: I like it +9 Vote: I do not like it

tourist is solving D I guess.

→ Reply
»
9 years ago, hide # |
← Rev. 4  
Vote: I like it -19 Vote: I do not like it

rng_58 and SnapDragon can surprise tourist. They are my favourites :)

→ Reply
»
9 years ago, hide # |
← Rev. 2  
Vote: I like it +1 Vote: I do not like it

tourist is about to be 4 time Code Jam Champion. He has a comfortable 20 point lead over zemen

→ Reply
»
9 years ago, hide # |
 
Vote: I like it +29 Vote: I do not like it

I found something random in the suggestions.

→ Reply
»
9 years ago, hide # |
 
Vote: I like it +6 Vote: I do not like it

Any one know if snapdragon's other solution was correct?

→ Reply
  • »
    »
    9 years ago, hide # ^ |
     
    Vote: I like it +104 Vote: I do not like it

    The stream was a little misleading; I only had the one hastily-coded solution. For each case, it just tries over and over to prove that the answer is "NO" (by taking two points, slightly perturbing them, and seeing if all the points lie on one side of that plane). Any "NO"s that it output were definitely correct, but "YES"s were suspect. I ran the large using 10,000 attempts, and submitted, then since I had more time, ran it with 100,000 attempts. That got me two more "NO"s.

    However, apparently I was still off by 17 cases ("NO"s that I reported as "YES"), so my randomized floating-point-based solution was probably doomed no matter what I did. I'm just lucky it worked for the Small. :)

    → Reply
»
9 years ago, hide # |
 
Vote: I like it +15 Vote: I do not like it

Why google do this competition every year if they can just give $15k to Gennady?

→ Reply
»
9 years ago, hide # |
 
Vote: I like it +14 Vote: I do not like it

I know that I cannot solve any of the problems, but just for the sake of my imagination can somebody tell me how hard the problems actually are . Are they Div 1 E or higher?

→ Reply
  • »
    »
    9 years ago, hide # ^ |
    ← Rev. 2  
    Vote: I like it -37 Vote: I do not like it

    They're very difficult. I can't solve any large.

    → Reply
  • »
    »
    9 years ago, hide # ^ |
     
    Vote: I like it +97 Vote: I do not like it
    • A small: D1 B, large: D1 D
    • B small: D1 C, large: D1 D
    • C D1 D
    • D small: D1 D, large: easy D1 E
    • E small: D1 B, large: too hard for a CF round
    • F small: D1 D, large: hard D1 E
    → Reply
    • »
      »
      »
      9 years ago, hide # ^ |
       
      Vote: I like it -27 Vote: I do not like it

      I found A large to be much simpler than B large. I would say A large is a Div 1C at best. There is not much difference in idea between the solution for small and large dataset and optimizing O(n3) to O(n2) isn't that hard.

      → Reply
»
9 years ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

Since comments are disabled in the live stream, I have to ask here. Does anyone know which song is played at 4:15:00?

→ Reply
»
9 years ago, hide # |
 
Vote: I like it +5 Vote: I do not like it

The Teleporters problem immediately reminded me of https://community.topcoder.com/stat?c=problem_statement&pm=12416

→ Reply