第 45 届国际大学生程序设计竞赛（ICPC）亚洲区域赛（济南）C-Stone Game

最新推荐文章于 2024-07-19 18:22:59 发布

原创

最新推荐文章于 2024-07-19 18:22:59 发布 · 1.4k 阅读

1 ·

CC 4.0 BY-SA版权

博客围绕石头堆合并问题展开，给定不同石头数量的石堆，每次合并两堆费用为(x%3)*(y%3)，目标是最小化将所有石堆合并成一堆的费用。思路是忽略三个一堆的石堆，优先合并1和2，处理剩余石堆，最后给出解题思路但未展示完整代码。

题目

题目描述
MianKing has nn piles of stones and each pile has at most 3 stones, now he wants to merge all of these stones into one pile.

In order to achieve his goal, each time MianKing can choose two piles of stones and merge them into a new pile, and the number of stones in the new pile is the sum of these two piles.

Because it takes manpower to move stones, in each operation if the numbers of these two piles of stones are xx and yy respectively, MianKing should pay $(x m o d 3) (y m o d 3)$ coins for it.