Difference between revisions of "ICPC 2019 Nanchang Online Contest"
Jump to navigation
Jump to search
Xiejiadong (talk | contribs) (Created page with "== Problem A == Solved by Kilo_5723. 02:26 (+1) == Problem B == Solved by Xiejiadong. 01:06 (+) == Problem C == Solved by Xiejiadong. 04:52 (+) == Problem D == Solved b...") |
Xiejiadong (talk | contribs) |
||
| Line 6: | Line 6: | ||
Solved by Xiejiadong. 01:06 (+) | Solved by Xiejiadong. 01:06 (+) | ||
| + | |||
| + | 题意：求一个点到其他点的最大距离 $/C$ 和好多个点到其他所有点最大距离比较。 | ||
| + | |||
| + | 题解：多源最短路，合并路径 max 即可。 | ||
| + | |||
| + | 注意不要去除 $C$ ，会发生各种问题，用多个点的距离乘 $C$ 即可。 | ||
== Problem C == | == Problem C == | ||
Revision as of 10:04, 8 September 2019
Problem A
Solved by Kilo_5723. 02:26 (+1)
Problem B
Solved by Xiejiadong. 01:06 (+)
题意：求一个点到其他点的最大距离 $/C$ 和好多个点到其他所有点最大距离比较。
题解：多源最短路，合并路径 max 即可。
注意不要去除 $C$ ，会发生各种问题，用多个点的距离乘 $C$ 即可。
Problem C
Solved by Xiejiadong. 04:52 (+)
Problem D
Solved by Weaver_zhu. 04:25 (+2)
Problem E
Solved by Xiejiadong && Kilo_5723. 02:33 (+)
Problem F
Unsolved.
Problem G
Solved by Xiejiadong. 00:06 (+)
温暖的签到。
Problem H
Solved by Weaver_zhu. 01:34 (+)
Problem I
Unsolved.