2017-2018 ACM-ICPC German Collegiate Programming Contest

Problem A

Solved by kblack. 03:43 (+1)

Problem B

Solved by ultmaster. 00:32 (+)

温暖的 Burnside 签到。

Problem C

Solved by ultmaster. 01:04 (+)

题意：非常繁琐。反正是跑一个每个点拆成 $x$ 个时间点的最短路。

题解：如题意。注意每个点可以待在上面不动（不然过不了样例）。

Problem D

Solved by kblack. 00:40 (+)

Problem E

Solved by zerol. 01:47 (+6)

Problem F

Solved by ultmaster. 02:29 (+)

题意：二分图匹配。左边可以选一个点配右边三个点。

题解：朴素的想法就是跑完一遍匹配之后把遍历左边的点，然后依次把每个点的容量改成 3，再改回去。这样做居然是能过的。（不知道为什么）

Problem G

Solved by kblack. 00:12 (+)

Problem H

Solved by zerol. 04:14 (+5)

Problem I

Solved by zerol. 00:23 (+)

Problem K

Solved by kblack. 00:18 (+)