Southern and Volga Russia Qualifier 2019-2020

From EOJ Wiki
Revision as of 10:31, 16 October 2019 by Xiejiadong (talk | contribs) (Created page with "== Problem A == Solved by Kilo_5723. 00:12 (+1) == Problem B == Solved by Weaver_zhu. 00:43 (+) == Problem C == Solved by Xiejiadong. 02:37 (+) == Problem D == Solved b...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
Jump to navigation Jump to search

Problem A

Solved by Kilo_5723. 00:12 (+1)

Problem B

Solved by Weaver_zhu. 00:43 (+)

Problem C

Solved by Xiejiadong. 02:37 (+)

Problem D

Solved by Kilo_5723. 00:36 (+1)

Problem E

Solved by Weaver_zhu. 00:19 (+)

Problem F

Solved by Xiejiadong. 00:44 (+)

Problem G

Solved by Xiejiadong. 01:06 (+)

Problem H

Solved by Kilo_5723. 01:59 (+3)

Problem I

Unsolved.

Problem J

Solved by Weaver_zhu. 01:38 (+)

Problem K

Solved by Weaver. 02:03 (+)

Problem L

Solved by Xiejiadong. 01:55 (+1)

题意:要求在某一个位置放置一个打印机,使得所有人到他的距离最小。

题解:枚举打印机放在每一个位置的时候,最远的距离。取最小值即可。