himanshujaju's blog

By himanshujaju, 15 months ago, In English,

Google Kick Start hosts online rounds throughout the year, giving participants the opportunity to test and grow their coding abilities while getting a sample of the programming skills needed for a technical career at Google. Top candidates might be invited for interviews.

I invite you to solve some fun and interesting problems on May 26 2019, 09:00 UTC.

Dashboard can be accessed here during the contest. Problem analysis will be published soon after the contest.

 
 
 
 
  • Vote: I like it
  • +19
  • Vote: I do not like it

»
15 months ago, # |
  Vote: I like it 0 Vote: I do not like it

The contest has started :) GL & HF

»
15 months ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve C?

  • »
    »
    15 months ago, # ^ |
    Rev. 2   Vote: I like it +4 Vote: I do not like it

    We can group the dogs by colors. And for each group of same color, we will visit the dogs in increasing distance. That means in a group of size $$$sz$$$, there are only $$$(sz + 1)$$$ options.

    Then we can use a standard knapsack dp to calculate the minimum. You can check the code the people on the scoreboard, since the code is very short.

    P.S: I overestimated the complexity and resubmitted at the last few minutes using another (and also more complicated) solution... Could've been in the first page of the scoreboard...

  • »
    »
    14 months ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    Also, I submitted my solution for Visible set to Hidden set after contest finishes and it passed that set too. Complexity is around $$$O(\frac{N^3}{2^x})$$$, not sure about x tbh, and it's not a surprise that it passes. It's the same solution as described in the editorial.

»
15 months ago, # |
  Vote: I like it +13 Vote: I do not like it

Is it only for me or the site is not accepting any submissions now?

I'm trying to submit some solution now but the submit button is not working?!!

»
13 months ago, # |
  Vote: I like it 0 Vote: I do not like it

Where I can find editorial for this round.