Shafaet's blog

HackerRank World Codesprint 10
By Shafaet, history, 7 years ago, In English

Hello Codeforces Community, I am glad to share HackerRank World Codesprint 10 starting on 28th April 2017. The contest duration is 24 * 2 =48 hours.

The winners of the contest will win up to 2000USD cash prizes. Also, there are opportunities to win T-shirts and Amazon Gift cards.

The contest will be rated. If two person gets the same score, the person who reached the score first will be ranked higher. There will be 7 algorithmic challenges in the contest.

The problems are prepared by malcolm, svanidz1, sgtlaugh, nabila_ahmed, kevinsogo and Shafaet. Thanks to danilka.pro , Wild_Hamster, HellKitsune and allllekssssa for testing the challenges and finalizing everything.

Update: the contest is starting in an hour!

Happy Coding!

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

»
7 years ago, # |
← Rev. 2   Vote: I like it -46 Vote: I do not like it

sorry for my comment.

→ Reply
»
7 years ago, # |
  Vote: I like it +22 Vote: I do not like it

Contest top page says

You’ll have 48 hours to solve 8 challenges and win prizes.

7 algorithmic challenges and 1 approximation challenge?

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +14 Vote: I do not like it

    That's a mistake, just 7 challenges. Thanks.

    → Reply
»
7 years ago, # |
  Vote: I like it -14 Vote: I do not like it

Hi Shafaet, how are the prizes distributed in case there are participants "not eligible to win prizes due to legal restrictions" in the top three? Judging by my previous experience it is not "Top 3 among eligible participants get the large prizes".

This information might be important when you decide on "Do I want to finish the last problem today or I will just go to bed now and finish it tomorrow?"

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

    I really want to know the answer :(

    EDIT : Just out of curiosity, what is wrong with our comments :/

    → Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +53 Vote: I do not like it

    I think they distribute prizes by their opportunities, so if you want to get prizes, you better be top 3.

    → Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Shafaet (previous revision, new revision, compare).

→ Reply
»
7 years ago, # |
  Vote: I like it +21 Vote: I do not like it

tourist finished with the entire problemset in just a little over an hour, it's crazy.

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it -29 Vote: I do not like it

    Well all problems except for the last one are pretty standard, so it's not so surprising.

    → Reply
»
7 years ago, # |
  Vote: I like it -36 Vote: I do not like it

What's the reason of taking away the approximate problem, and even not adding another problem? The first six problems are not so hard and many people solved them all, but the last problem seems really hard (what's worse, it doesn't have partial scoring). Without the approximate problem, your place will only depend on when you choose to solve those six problems. Time should really matter only when all participants solve those problems at the same time.

Please, bring back the approximate problem next time :(

→ Reply
»
7 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Anybody has good links about FFT(other than wikipedia)? I have no idea at all what it is, and last problem requires it according to editorial.

→ Reply
»
7 years ago, # |
  Vote: I like it +10 Vote: I do not like it

Problem F was the same as 196C - Paint Tree

→ Reply
  • »
    »
    7 years ago, # ^ |
      Vote: I like it +5 Vote: I do not like it

    You have to output where is i on answer array instead of answer, I think it makes challenge harder.

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

It would be nice to see the solution of others. Its not available yet!

→ Reply
»
7 years ago, # |
  Vote: I like it +3 Vote: I do not like it

I guess the 5th problem has a bit weaker data set. I iterated over all siblings of each node instead using prefix and suffix sum. And it passed in just 0.4s. code

→ Reply
»
7 years ago, # |
  Vote: I like it +1 Vote: I do not like it

Please make the codes public.

→ Reply
»
7 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Hello, Can anybody give a better explained insight about the 5th problem (Maximum Disjoint Subtree Product) ?? I can't figure it out from the psetter analysis. I don't understand 2nd DFS approach (it tries to calculate the solution for "up subtrees"??)

Please can someone help me and/or give me other problems following the same solution approach ???

Thanks in advance :D

→ Reply