hmehta's blog

Topcoder SRM 747 and Editorials
By hmehta, history, 6 years ago, In English

Topcoder SRM 747 is scheduled to start at 11:00 UTC -5, Jan 19, 2018. Registration is now open for the SRM in the Web Arena or Applet and will close 5 minutes before the match begins

Editorials: https://www.topcoder.com/blog/single-round-match-747-editorials/

This is the fifth SRM of Stage 2 of TCO19 Algorithm.

Stage 2 TCO19 Points Leaderboard | Topcoder Java Applet | Next SRM 748 — January 26

Hope to see most of you competing! All the best!

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

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

So boring. I feel like I participated in div. 2 contest.

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

    You solve div II easy for 75 points? < /stalker >

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

This time, double/long double works on 500.

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

My screencast: https://youtu.be/EUP-kY-sZ18

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

Is there any EASY way to solve recently Completed Contest(I mean to submit codes)?

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

Any hint on the main idea of DivI 500 — the maximum ties?

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

    DP: dp[t][p][mx][cnt] = answer if we have t tokens and p piles to put them and maximum of piles is mx and number of ties in maximum is cnt.

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

      No reason to not make last dimension binary

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

        Hello, how would the state transition be then?

        I only understood the solution of tourist, which is a monotonically increasing dfs pile generation.

        → Reply
        • »
          »
          »
          »
          »
          6 years ago, # ^ |
          ← Rev. 4   Vote: I like it -26 Vote: I do not like it

          I hope that my code should be self-explanatory (newt[i][j] is obviously Newton's symbol (i choose j) and pr is a probability that we out here coins to last stack out of prvt + here coins)

          (you may want to open it in separate tab to make it larger)

          → Reply