Attention!!!!
Google's hiring contest, Kickstart 2017 Round C is going to held on Sunday, June 25, 2017 19:00 UTC – 22:00 UTC.
Ready to get started solving fun, challenging problems? Throughout the year, Code Jam hosts online Kickstart rounds to give students the opportunity to develop their coding skills, get acquainted with Code Jam’s competition arena, and potentially get noticed by Google recruiters, too. Participate in one—or join them all!
Please visit here to join and fun!!!!
upto what rank will be called for an interiew at google?
Here's your answer, Read It
How to solve C large and D?
I solved C Large with DP when
N == 2, such that:dp[i][s1][s2] := max score that I have acquired starting at i-th question such that player 1 has s1 points and player 2 has s2 points left to obtain.The transitions are quite straightforward, you just need to check if your i-th answer matches with the other players' answers, and then act accordingly.
Code.
Didn't recognized that it can be solved by dp. Was trying to somehow apply greedy.
Actually greedy works for large set
Here's a link to the official analysis