2015 ACM-ICPC Asia Beijing Regional Contest

From EOJ Wiki
Jump to navigation Jump to search

Problem A

Solved by Xiejiadong. 01:24:36(+)

题意:沿$x$轴把沙漠分成两块,使得两边的绿地面积之差最小。

题解:根据给出的绿地坐标,在开始位置和结束位置分别打上tag,然后枚举所有的分割点,找到最小差的位置就可以了。

时间复杂度$O(R)$。

Problem B

Unsolved.

Problem C

Solved by oxx1108. 04:23:23(+3)

Problem D

Upsolved by dreamcloud.

Problem E

Unsolved.

Problem F

Unsolved.

Problem G

Solved by Xiejiadong. 02:37:08(+)

Problem H

Unsolved.

Problem I

Solved by dreamcloud. 03:34:10(+4)

Problem J

Solved by Xiejiadong. 00:27:41(+)

Problem K

Solved by dreamcloud. 04:45:00(+4)