Difference between revisions of "2014-2015 ACM-ICPC, Asia Mudanjiang Regional Contest"
Jump to navigation
Jump to search
| Line 8: | Line 8: | ||
Solved by ultmaster. 03:48 (+) | Solved by ultmaster. 03:48 (+) | ||
| + | |||
| + | 题意：在树上装两盏半径为 $r$ 的路灯，要求覆盖整棵树。求最小的 $r$。 | ||
| + | |||
| + | 题解：我们大概可以猜出这两盏路灯一定装在直径的第 $r$ 个点，和倒数第 $r$ 个点上。二分答案判一判就好了。 | ||
== Problem D == | == Problem D == | ||
Revision as of 13:29, 14 November 2018
Problem A
Solved by zerol. 00:32 (+1)
温暖的签到。但是我把 m 打成 n 了。。。
Problem B
Solved by ultmaster. 03:48 (+)
题意：在树上装两盏半径为 $r$ 的路灯，要求覆盖整棵树。求最小的 $r$。
题解：我们大概可以猜出这两盏路灯一定装在直径的第 $r$ 个点，和倒数第 $r$ 个点上。二分答案判一判就好了。
Problem D
Solved by kblack. 03:23 (+1)
Problem E
Unsolved. (-1)
Problem H
Solved by kblack. 02:56 (+1)
Problem I
Solved by kblack. 00:34 (+)
Problem K
Solved by kblack. 00:20 (+)