2018 Multi-University, HDU Day 7

Problem A

Solved by kblack. 01:47 (+2)

题意：给一个边上带颜色的无向图，走的边颜色变化一次花 1，求最短路。

题解：边上加个点，到两个端点距离为 1，一个点出去的同色边缩一下，因为距离都是 1，跑 bfs 就好了，卡常。。。

Problem B

Solved by ultmaster. 04:56 (+4)

Problem D

Upsolved by kblack. (-2)

Problem E

Solved by ultmaster. 00:57 (+1)

Problem H

Solved by ultmaster. 01:41 (+)

Problem I

Solved by zerol. 01:26 (+1)

Problem J

Solved by kblack. 00:43 (+1)

Problem K

Solved by zerol. 02:04 (+)