2018-2019 ICPC, NEERC, Southern Subregional Contest

From EOJ Wiki
Revision as of 13:51, 24 October 2018 by Zerol (talk | contribs) (→‎Problem E)
Jump to navigation Jump to search

Problem A

Solved by ultmaster. 00:20 (+)

Problem B

Solved by kblack & zerol. 03:48 (+1)

Problem C

Solved by kblack. 00:55 (+)

Problem D

Solved by kblack. 00:12 (+)

Problem E

Solved by zerol. 01:59 (+)

题意:选取一个最优的 d 使得在 t 时间内完成最多的任务。策略如下,只会做耗时不超过 d 的任务,每做 m 个任务都会休息之前 m 个任务的耗时和等长的时间。

题解:将所有任务按耗时排序,从小到大一批批加进去,然后用二分时间判断能完成的最多任务数,可以树状数组上二分计算前若干个任务的耗时和。

Problem F

Solved by zerol. 00:45 (+)

Problem G

Solved by zerol. 04:44 (+2)

Problem H

Solved by kblack. 00:28 (+)

Problem I

Solved by ultmaster. 03:54 (+3)

Problem J

Solved by kblack. 02:06 (+3)

Problem K

Solved by zerol. 00:07 (+)

温暖的签到。