We will hold AtCoder Regular Contest 214.
- Contest URL: https://atcoder.jp/contests/arc214
- Start Time: http://www.timeanddate.com/worldclock/fixedtime.html?iso=20260208T2100&p1=248
- Duration: 120 minutes
- Writer: snuke
- Tester: Nyaan, maspy
- Rated range: 1200 ~ 2799
- Point Values: 300-500-600-700-700-900
We are looking forward to your participation!








Problem D is a bit difficult for me, and the editorial just says "construct it like this" and then gives a construction and code. However, I'm having trouble understanding exactly how it works and how one would come up with it. Is this really just an ad-hoc problem? I'm more inclined to believe that it's because "No self-respecting architect leaves the scaffolding in place after completing his building" which led the editorial to omit the problem proposer's thought process. Could someone share how they arrived at the idea? Thanks.
I figured out a construction by "hey how about sorting paths lexicographically and giving them sums equal to their indices in this order". Intuitively, it can work since you just fill up everything to the right of a cell, put a large number in the cell immediately downwards from it and you're guaranteed that paths that start by going down from it have all larger sums than those going right. As long as you fill up everything to the bottom this way as well, the required property is guaranteed.
The only question is if the smallest value of that "large number" could even be negative, in which case exact equality with sorted indices is impossible. Turns out that's not the case. You can even calculate it by "brute force" as largest path starting to the right minus smallest path that started down.
Beautiful simple solution for C from power series: $$$x^a + y^a + x^{-a} + y^{-a} = (x^a+y^a)(1 + (xy)^{-a})$$$, we want the term with $$$x^0 y^0$$$ in the product where $$$a = P_i$$$. Since the second bracket has the same coefficients of $$$x$$$ and $$$y$$$ in each term, the first bracket's product also needs that, and the sum of coefficients is always $$$S = \sum P_i$$$ so those have to be $$$x^{S/2} y^{S/2}$$$, and for the second bracket's product it also has to be $$$(xy)^{-S/2}$$$. Both are the same and calculated using knapsack.
Am I the only one who finds C very difficult (for 600pts level)?