Difference between revisions of "2011 ACM-ICPC World Finals"
Jump to navigation
Jump to search
Line 10: | Line 10: | ||
Solved by zerol. 00:46 (+) | Solved by zerol. 00:46 (+) | ||
+ | |||
+ | 签到 | ||
+ | |||
+ | 题意:图像识别 | ||
+ | |||
+ | 题解:数内部联通块个数 | ||
== Problem D == | == Problem D == |
Revision as of 15:54, 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 (+)
曼哈顿距离转切比雪夫距离签到。
U: 题目本身非常傻逼,没什么好说的。但是:
- 我读错了题。两次。
- kblack 搞出了某些非常玄幻的做法,导致一度不会做这个题。
- 好在稳健的 Z 给出了这题是签到题的指导性意见,然后就过了。
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 (+)
题意:求一个最小的间距使得多边形刚好能卡过。
题解:求完凸包,旋转卡壳。但是数据范围太小了根本不需要。