2018-2019 ACM-ICPC, NEERC, Southern Subregional Contest, Qualification Stage

From EOJ Wiki
Jump to navigation Jump to search

欢乐信心场。

Problem A

Solved by ultmaster. 00:17 (+)

题意:挺奇怪的。要把一些东西安排一下,做完一件事情必须要休息一段时间,然后最少要多久完成。每件事情的开始时刻在剩余系下是有规定的。

题解:反正贪心往前放就好了。

Problem B

Solved by ultmaster. 01:32 (+2)

题意:从某个点出发向右走,有一些区间可以横着走,还有一些区间再向右走的同时会向下掉。求问最长能走多少。

题解:肯定是从横着走的区间的左端点开始的。然后滑动窗口或二分都可以。

DIRT1:没有处理最后一段以后的问题。二分边界错了。(开闭搞晕了)

DIRT2:没有意识到等于 0 的时候也会凉凉。

Problem C

Solved by kblack. 00:47 (+1)

Problem D

Solved by zerol. 00:55 (+)

Problem E

Solved by zerol. 01:49 (+)

Problem F

Solved by kblack. 00:27 (+)

Problem G

Solved by zerol. 01:08 (+)

Problem H

Solved by ultmaster. 00:38 (+)

题意:有一个形状奇怪的东西,用 1x2 的瓷砖去填,瓷砖只能横着放。放不下就得把瓷砖劈成两半。问最少劈几块瓷砖。

题解:求一下最少需要几块 1x1 的,然后除以 2 取上整就好了。

Problem I

Solved by zerol. 00:05 (+)

Problem J

Solved by zerol. 00:09 (+)

Problem K

Solved by kblack. 01:37 (+)

Problem L

Solved by kblack. 02:11 (+2)