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

Jump to navigation
Jump to search

Line 38: | Line 38: | ||

Solved by ultmaster. 02:53 (+3) | Solved by ultmaster. 02:53 (+3) | ||

+ | |||

+ | 题意：300 * 1000000 的 01 背包，求方案，要物品数量尽量少，同时字典序最大。 | ||

+ | |||

+ | 题解：发明了若干种假算法之后，直接开了个 300*1000000 的数组存储所有点的最短路径。 | ||

== Problem K == | == Problem K == |

## Revision as of 07:42, 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)

题意：300 * 1000000 的 01 背包，求方案，要物品数量尽量少，同时字典序最大。

题解：发明了若干种假算法之后，直接开了个 300*1000000 的数组存储所有点的最短路径。

## Problem K

Solved by ultmaster. 01:28 (+)

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

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