1228.md (2547B)
1 Source: https://codeforces.com/blog/entry/70162 2 3 Hello, I hope all of you enjoyed my contest! 4 5 Tutorial is loading... 6 7 **[Behind story of A]** 8 9 * There is a successful hack for A. I am really surprised. 10 * My code: <https://codeforces.com/contest/1228/submission/61578842> 11 12 Tutorial is loading... 13 14 **[Behind story of B]** 15 16 * There is no behind story. 17 * My code: <https://codeforces.com/contest/1228/submission/61578841> 18 19 Tutorial is loading... 20 21 **[Behind story of C]** 22 23 * Initial version of C statement consists of tons of mathematical formula. CF team and testers requested me to reduce amount of mathematical formula. 24 * This problem was added before a week to the round. If there was no such C, the balance would be bad. 25 * Thanks for [dorijanlendvaj](/profile/dorijanlendvaj "Grandmaster dorijanlendvaj") , he improved test data for C a lot! 26 * My code: <https://codeforces.com/contest/1228/submission/61578856> 27 28 Tutorial is loading... 29 30 **[Behind story of D]** 31 32 * Same as C, I wrote tons of mathematical formula in D. After CF team's request, I reduced the amount of formula. 33 * This is my personal favorite problem among ABCDEF. 34 * My code: <https://codeforces.com/contest/1228/submission/61578861> 35 36 Tutorial is loading... 37 38 **[Behind story of E]** 39 40 * [MikeMirzayanov](/profile/MikeMirzayanov "Headquarters, MikeMirzayanov") changed the name of problem before 10~20 minutes to the contest. It was "Minimum One" before. 41 * This problem was the easiest to prepare data. Just pure random and $k=1$ is strong enough. 42 * I managed to create $O(n^3)$ [pypy3 solution](https://codeforces.com/contest/1228/submission/61578876) for E in 1 second lol. 43 * Thanks [tfg](/profile/tfg "Grandmaster tfg") for providing $O(n \log n)$ solution. 44 * My code: <https://codeforces.com/contest/1228/submission/61578868> 45 46 Tutorial is loading... 47 48 **[Behind story of F]** 49 50 * This problem was the hardest to prepare data. We considered more than 10 types of trees to block various kind of WA solutions. 51 * I intended top-down error-toleration based case handling approach for this contest, but seems other approaches are also ok. 52 * Also thanks for [dorijanlendvaj](/profile/dorijanlendvaj "Grandmaster dorijanlendvaj") here, he is real MVP tester. 53 * My code: <https://codeforces.com/contest/1228/submission/61578884> 54 55 **[Behind story of G (removed problem)]** 56 57 * Nobody(including red testers) solved this problem for a week. This problem is saved as spare problem for another Div.1 contest. 58 * I love this beautiful problem than any other problems I ever made. 59 60 Thanks in advance!