akulsareen's blog

Invitation to 101 Hack 46
By akulsareen, history, 8 years ago, In English

Hello Coders!

The 46th edition of 101 Hack is here. There will be 5 very interesting challenges in 2 hours. The contest commences on on 14th February 2017 at 16:00 UTC, You can sign up for the contest here.

Top 10 on leaderboard get cool HackerRank T Shirts

Problem Setters
satyaki3794, akulsareen, pranet

Problem Testers
niyaznigmatul, mfv

I would also like to thank shashank21j for all his help during the preparation of the contest and making sure that we actually make the problems instead of just talking about making them.

A lot of effort has gone into making sure the contest has something for everyone so I strongly recommend you to participate and to read all problems. I hope you will enjoy solving the problems as much as we did making them.

Editorials will be available at the end of contest.

GL&HF

UPD: Contest has finished. Top 10 are as follows:

  1. anta

  2. uwi

  3. Kaban-5

  4. I_love_Tanya_Romanova

  5. Deemo

  6. Sarkin

  7. kuzmichev_dima

  8. yenthanh.t7

  9. Tima

  10. WHITE2302

Editorials should be up shortly. Feel free to discuss the problems and give your feedback in the comments. Hope you had fun.

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

»
8 years ago, # |
  Vote: I like it +89 Vote: I do not like it

Smart coders, please find a girlfriend and I will be okay with just a T-shirt.

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

Reminder. Contest starts in ~ 10 minutes. GL & HF.

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

Any feedback on the problems and the contest?

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

So still I haven't ever coded a working 2d segment tree, it seems :D Was DP with 2d segment tree the expected solution? If not, please can someone explain :))

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

    That can work, but the intended solution uses divide and conquer + 1-d segment tree (point update, range query). Editorial should be available now.

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

      Seems like the constant multiplier using 2D Segment Tree is quite huge. I got TLE on some cases using 2D Segment Tree.

      Finally get AC after desperately adding a lot of prunings in my code. Unfortunately, doing that consumes a lot of my time and I don't have enough time to get enough partial marks for C and E :(

      12th, close to T-shirt boundary :"(

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

        And thats why it wasn't the intended solution :P

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

Counting Road Networks can be solve by technique describe at here.

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

    My intended solution is similar to the one described in the link you shared.

    kevinsogo has also added an approach to the editorial.

    → Reply