2018-2019 ACM-ICPC, Asia Seoul Regional Contest

From EOJ Wiki
Revision as of 15:54, 12 February 2019 by Zerol (talk | contribs) (→‎Problem A)
Jump to navigation Jump to search

Problem A

Solved by zerol. 02:10 (+)

题意:给定若干和区间,要求选取两个点,使得尽可能多的区间包含这两个点中的一个。

题解:枚举一个点的位置,然后用线段树维护除去和枚举的那个点有交的剩下的区间的最大的重叠点。

Problem B

Unsolved.

Problem C

Unsolved.

Problem D

Solved by zerol. 00:11 (+1)

真·签到。+1 是因为交错 python 版本了。

Problem E

Solved by kblack. 03:15 (+3)

题意:求一个简单分段函数的最小误差最大值估计。

题解:二分然后瞎几吧搞搞,特别注意 0 位置。

Problem F

Solved by ultmaster. 01:51 (+3)

题意:表达式解析,要求判出非法、合法。如果合法,建出表达式树,问是否是一棵二叉树。

题解:如题,模拟。脑残少判了一个地方,自闭一小时。

坑点:经枚举题意,一个节点不算二叉树。

Problem G

Unsolved. (-4)

Problem H

Unsolved.

Problem I

Unsolved.

Problem J

Unsolved and Executed.

Problem K

Solved by kblack. 01:32 (+)

题意:一个二进制串,一些人各自猜了三个位置,构造让所有人都猜对至少两个位置。

题解:考虑一个人的三个位置中的任意两个,或一定是真,经典 2-SAT。

Problem L

Solved by kblack. 01:04 (+1)

温暖的贪心,自信减少条件,已枪毙。