Difference between revisions of "2016 ACM-ICPC World Finals"

From EOJ Wiki
Jump to navigation Jump to search
Line 16: Line 16:
  
 
Solved by zerol. 00:20 (+)
 
Solved by zerol. 00:20 (+)
 +
 +
温暖的签到。
  
 
== Problem D ==
 
== Problem D ==

Revision as of 13:35, 24 March 2019

Problem A

Solved by zerol. 04:30 (+1)

CF 突然炸了。就交在 kattis 上了。

题意:有一些糖果,每个糖果有一个比例,对于任意前若干天,天数和比例之积必须和该糖果的数量之差的绝对值在 1 之内。一开始给了若干天合法的吃糖果方案,问最多还能撑几天不破坏平衡性(当然也可以一直平衡下去)。

题解:计算出每一种糖果如果不去吃它能撑到那一天,然后每次吃那个最先凉掉的,如果发现早就凉了那就结束了。另外,容易程度会随着天数的增加而增加,如果前面很多天都没问题那就真的没问题了。

Problem B

Solved by ultmaster. 03:38 (+1)

Problem C

Solved by zerol. 00:20 (+)

温暖的签到。

Problem D

Solved by ultmaster. 01:10 (+1)

Problem E

Solved by ultmaster. 01:40 (+2)

Problem F

Unsolved.

Problem G

Solved by kblack. 02:19 (+2)

题意:要一根不平行于 x 轴的直线使得相交的线段数最长。

题解:总可以调整使得目标直线至少经过一条线段的某个顶点,转一圈。

Problem H

Unsolved.

Problem I

Unsolved.

Problem J

Unsolved.

Problem K

Solved by zerol. 02:40 (+1)

Problem L

Solved by kblack. 00:49 (+)

大鱼吃小鱼签到。

Problem M

Unsolved.