CCPC-Wannafly Winter Camp Day1

From Ingenuity Wiki

Problem A

unsolved. (-2)

Peroblem C

solved by Moira. 2:42(+)

Problem E

upsolved by CSL. (-2)

根据角谷猜想,给定的图是一棵树(但是因为 $3i + 1$可能大于 $n$,可能退化为森林。)直接树形DP即可。

Comment: 比赛的时候被 $n \leq 100$ 的数据范围骗去网络流了,orz。

Problem F

solved by CSL. 1:07(+)

根据机械能守恒(雾)直接把对应花费加到点上,拆点跑最短路。

Problem H

unsolved. (-7)

Problem J

unsolved. (-3)