Difference between revisions of "2019-2020 ICPC Northwestern European Regional Programming Contest (NWERC 2019)"
Jump to navigation
Jump to search
(Created page with "== Problem A == Solved by bingoier. 01:34 (+) == Problem B == Unsolved. == Problem C == Solved by yanghong. 00:48 (+1) == Problem D == Unsolved. == Problem E == Solve...") |
|||
| Line 2: | Line 2: | ||
Solved by bingoier. 01:34 (+) | Solved by bingoier. 01:34 (+) | ||
| + | |||
| + | 将每一位参赛选手的 $Rank$ 之和分为两部分，第一部分为其得分总和所在层的代价，第二部分为其自身的特殊代价。 | ||
| + | 对于每一层（代表不同得分）用 $K_i*w+B_i$ 表示当前这一层每位参赛选手第一部分的得分总和，每位选手的特殊代价使用数组记录即可。 | ||
| + | 我们会发现当有一名选手的得分增加时，只有之前与之得分相同的选手（即在同一层的选手）会受到影响。 | ||
| + | 因此我们可以通过代换将这一层的 $K_i,B_i$ 变化到对应值，再修改当前次操作对于这名选手的特殊代价即可。 | ||
== Problem B == | == Problem B == | ||
Revision as of 01:13, 12 October 2020
Problem A
Solved by bingoier. 01:34 (+)
将每一位参赛选手的 $Rank$ 之和分为两部分，第一部分为其得分总和所在层的代价，第二部分为其自身的特殊代价。 对于每一层（代表不同得分）用 $K_i*w+B_i$ 表示当前这一层每位参赛选手第一部分的得分总和，每位选手的特殊代价使用数组记录即可。 我们会发现当有一名选手的得分增加时，只有之前与之得分相同的选手（即在同一层的选手）会受到影响。 因此我们可以通过代换将这一层的 $K_i,B_i$ 变化到对应值，再修改当前次操作对于这名选手的特殊代价即可。
Problem B
Unsolved.
Problem C
Solved by yanghong. 00:48 (+1)
Problem D
Unsolved.
Problem E
Solved by yanghong. 00:22 (+2)
Problem F
Solved by bingoier. 00:32 (+)
Problem G
Solved by yanghong. 01:54 (+3)
Problem H
Solved by bingoier. 03:54 (+3)
Problem I
Solved by bingoier. 00:19 (+)
Problem J
Solved by yanghong. 03:46 (+4)
Problem K
Unsolved.