Difference between revisions of "2018-2019 ACM-ICPC, Asia Seoul Regional Contest"

From EOJ Wiki
Jump to navigation Jump to search
Line 18: Line 18:
  
 
Solved by kblack. 03:15 (+3)
 
Solved by kblack. 03:15 (+3)
 +
 +
题意:求一个简单分段函数的最小误差最大值估计。
 +
 +
题解:二分然后瞎几吧搞搞,特别注意 0 位置。
  
 
== Problem F ==
 
== Problem F ==

Revision as of 14:18, 12 February 2019

Problem A

Solved by zerol. 02:10 (+)

Problem B

Unsolved.

Problem C

Unsolved.

Problem D

Solved by zerol. 00:11 (+1)

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.

Problem K

Solved by kblack. 01:32 (+)

Problem L

Solved by kblack. 01:04 (+1)