这是本文档旧的修订版!
upsolved by
solved by
upsolved by
solved by
upsolved by
solved by Bazoka13
几艘容量固定的船,每次可以清空一艘,装满一艘或者互相倒水,求恰好一艘船有$A$升水的方案。
范围不大,直接用队列把可以到达的情况全部暴力预处理出来同时记录用的哪艘船,如果方案存在倒着跳一遍即可
upsolved by
solved by
upsolved by
upsolved by
upsolved by