Difference between revisions of "2015 ACM-ICPC Asia Beijing Regional Contest"

From EOJ Wiki
Jump to navigation Jump to search
(Created page with "== Problem A == Solved by Xiejiadong. 01:24:36(+) == Problem B == Unsolved. == Problem C == Solved by oxx1108. 04:23:23(+3) == Problem D == Upsolved by dreamcloud. ==...")
 
 
(3 intermediate revisions by one other user not shown)
Line 2: Line 2:
  
 
Solved by Xiejiadong. 01:24:36(+)
 
Solved by Xiejiadong. 01:24:36(+)
 +
 +
题意:沿$x$轴把沙漠分成两块,使得两边的绿地面积之差最小。
 +
 +
题解:根据给出的绿地坐标,在开始位置和结束位置分别打上tag,然后枚举所有的分割点,找到最小差的位置就可以了。
 +
 +
时间复杂度$O(R)$。
  
 
== Problem B ==
 
== Problem B ==
Line 26: Line 32:
  
 
Solved by Xiejiadong. 02:37:08(+)
 
Solved by Xiejiadong. 02:37:08(+)
 +
 +
题意:给出四个矩形,问是否存在三个矩形,可以拼成一个更大的矩形。
 +
 +
题解:拼起来的方式无非下面两种:
 +
 +
1)三个串起来,即某一维相等。
 +
 +
2)一个在上方,两个在下方,即某两个的两个维度之和等于第三个维度,且这两个的另一个维度相等。
 +
 +
暴力,比较繁琐。
  
 
== Problem H ==
 
== Problem H ==
Line 38: Line 54:
  
 
Solved by Xiejiadong. 00:27:41(+)
 
Solved by Xiejiadong. 00:27:41(+)
 +
 +
题意:温暖的签到。
 +
 +
题解:答案就是连续上升的长度和s之和。
  
 
== Problem K ==
 
== Problem K ==
  
Solved by dreamcloud. 04:45:00(+4)
+
Solved by oxx. 04:45:00(+4)

Latest revision as of 02:12, 21 October 2018

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(+)

题意:给出四个矩形,问是否存在三个矩形,可以拼成一个更大的矩形。

题解:拼起来的方式无非下面两种:

1)三个串起来,即某一维相等。

2)一个在上方,两个在下方,即某两个的两个维度之和等于第三个维度,且这两个的另一个维度相等。

暴力,比较繁琐。

Problem H

Unsolved.

Problem I

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

Problem J

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

题意:温暖的签到。

题解:答案就是连续上升的长度和s之和。

Problem K

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