kevinsogo's blog

101 Hack 51 — HackerRank
By kevinsogo, 7 years ago, In English

Hello Codeforces community,

I would like to invite you to join HackerRank's 101 Hack 51 which starts at 1500 UTC, August 7, 2017.

There will be five tasks and three hours for you to solve them. The contest will be rated and the top ten contestants will receive HackerRank T-shirts!

The problems are prepared by Yury Shilyaev (hloya_ygrt) and Vlad Vishnevsky (Vladik). (HackerRank only displays one author per problem, but the whole set was actually prepared by both.) I tested the problems and I found them to be interesting. I hope you'll enjoy the problems as much as I did!

Happy Coding!

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

Comments Comments (10)
| Write comment?
»
7 years ago, # |
  Vote: I like it +15 Vote: I do not like it

On HR, Can we filter leaderboard according to people we follow?

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

    They should really add this feature! I love cf because of this!

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

      UPD — Now we can see friends standings! :)

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

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

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

Is brute force the intended solution for B? I managed to grab > 50 pts with it.

EDIT: Nope, I guess it had weak test cases.

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

    Really what brute force approach did you use? Mine only gave 24 points.

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

      Here: https://ideone.com/k6yG4z

      It gets TLE on only two test cases. I have also used the fact that if you can't arrange sufficient bricks for a pyramid of size s with top left corner at (i, j), then you cannot hope to create a pyramid of size > s with the same top left corner.

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

    Nope, it is our fault. But I didn't find the submission, that got fullscore with brute. Almost every testset contained matrix with 90% of 1s and 10% of 2s, but it was easy passed by optimized brute.

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

    Lol, wrong blog again. :P

    → Reply