ACM-ICPC 2015 Asia Tsukuba Regional

From EOJ Wiki
Revision as of 10:47, 7 October 2018 by Kblack (talk | contribs) (→‎Problem D)
Jump to navigation Jump to search

Problem A

Solved by zerol. 00:15 (+)

温暖的签到。

Problem B

Solved by zerol & ultmaster. 00:24 (+)

Problem C

Solved by ultmaster. 01:39 (+4)

Problem D

Solved by kblack. 01:42 (+)

题意:在一个矩形内,每个人有一个直角的视野,在墙上挂钟使得每个人都能至少看到一个钟。

题解:直角视野对应周长上的一个区间,然后就是一个在环上丽娃河装路灯的问题。我们枚举第一个钟的位置,之后贪心地尽量靠后安装。

Problem E

Solved by ultmaster. 03:50 (+)

Problem F

Solved by kblack. 04:22 (+9)

Problem G

Solved by zerol. 03:31 (+)