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/
- Problem Writer: misof CF:misof
- Tester: Blue.Mary CF:lucyanna2018
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!
So boring. I feel like I participated in div. 2 contest.
You solve div II easy for 75 points? < /stalker >
This time, double/long double works on 500.
My screencast: https://youtu.be/EUP-kY-sZ18
Is there any EASY way to solve recently Completed Contest(I mean to submit codes)?
Any hint on the main idea of DivI 500 — the maximum ties?
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.
No reason to not make last dimension binary
Hello, how would the state transition be then?
I only understood the solution of tourist, which is a monotonically increasing dfs pile generation.
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)