Difference between revisions of "2017-2018 ACM-ICPC German Collegiate Programming Contest"
Jump to navigation
Jump to search
(Created page with "== Problem A == Solved by kblack. 03:43 (+1) == Problem B == Solved by ultmaster. 00:32 (+) 温暖的 Burnside 签到。 == Problem C == Solved by ultmaster. 01:04 (+)...") |
|||
| Line 12: | Line 12: | ||
Solved by ultmaster. 01:04 (+) | Solved by ultmaster. 01:04 (+) | ||
| + | |||
| + | 题意：非常繁琐。反正是跑一个每个点拆成 $x$ 个时间点的最短路。 | ||
| + | |||
| + | 题解：如题意。注意每个点可以待在上面不动（不然过不了样例）。 | ||
== Problem D == | == Problem D == | ||
Revision as of 12:53, 26 September 2018
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 (+)
Problem G
Solved by kblack. 00:12 (+)
Problem H
Solved by zerol. 04:14 (+5)
Problem I
Solved by zerol. 00:23 (+)
Problem J
Problem K
Solved by kblack. 00:18 (+)