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

From EOJ Wiki
Jump to navigation Jump to search
(Created page with "== Problem A == Unsolved. == Problem B == Unsolved. == Problem C == Solved by zerol. 00:46 (+) == Problem D == Unsolved. == Problem E == Solved by ultmaster. 03:53 (+...")
 
Line 42: Line 42:
  
 
Solved by ultmaster. 01:28 (+)
 
Solved by ultmaster. 01:28 (+)
 +
 +
题意:求一个最小的间距使得多边形刚好能卡过。
 +
 +
题解:求完凸包,旋转卡壳。但是数据范围太小了根本不需要。

Revision as of 07:41, 2 March 2019

Problem A

Unsolved.

Problem B

Unsolved.

Problem C

Solved by zerol. 00:46 (+)

Problem D

Unsolved.

Problem E

Solved by ultmaster. 03:53 (+)

Problem F

Unsolved. (-3)

Problem G

Unsolved.

Problem H

Solved by zerol. 04:39 (+1)

Problem I

Solved by kblack. 04:06 (+1)

Problem J

Solved by ultmaster. 02:53 (+3)

Problem K

Solved by ultmaster. 01:28 (+)

题意:求一个最小的间距使得多边形刚好能卡过。

题解:求完凸包,旋转卡壳。但是数据范围太小了根本不需要。