每次找到一种颜色，满足有一个盘子在第一层 (从上往下)，且其余两个盘子不都在第三层。容易证明这样的颜色一定存在。可以用不超过 $6$ 步把这个颜色的三个盘子放在同一个柱子上且还原出一个空的柱子。不超过 $6n-6$ 步之后就复原了所有颜色，最后再用 $3$ 步把第 $n+1$ 根柱子上的盘子移走即可。
QOJ.ac
QOJ
As we are currently experiencing an overwhelming number of web requests for fetching user submissions, we have temporarily disabled the full submissions list. You must now be logged in to view submissions.
Discussion #310 for Problem #1646. Disk Sort
Type: Editorial
Status: Open
Posted by: jiangly
Posted at: 2025-12-14 07:02:17
Last updated: 2025-12-14 07:02:19
题解
Comments
No comments yet.