当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

2798:Cai In

题目描述
Hero Goblin Techies in DOTA have two skills: Remote Mines - Plants a powerful mine that only detonates when triggered and Detonate - Detonates all remote mines at the same time.
A mine with power A will demage enemy r away from it 1000 * A / (r * r). And when all mines detonate at the same time, the demage to an enemy is the maximum of all the mines, that is maximus of 1000 * A[i] / (r[i] * r[i]).



Goblin Techies has plant many mines in the map, and Panda want to pass the dangerous region.
The region is square, with each side of length 100.0. The coordinate of the southwest corner is (x = 0, y = 0) and the coordinate of the northeast corner is (x = 100, y = 100).
The Panda will enter at (50, 0) and exit at (50, 100), and won't go out of the region in any other way.

Given the coordinates and powers of all mines in the region, what shound the Panda's HP be at least if Panda want to pass the region before he died? Assume Panda will choose the best path.
输入解释
Each case have four lines. The first line are n integers x[i], the second line are n integers y[i], the third line are n integers A[i], the last line is an empty line. 1 <= n <= 55.
输出解释
The least HP. Keep three digits after the decimal point.
输入样例
50
2
87

20 50 70
50 70 80
42 42 42

10 10 10 20 30 40 50 60 40 50 60 70 80 80 80 90 90 90
40 50 60 60 60 60 60 70 30 30 30 30 40 30 20 50 40 10
90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90 90
输出样例
21750.000
105.000
400.000
来自杭电HDUOJ的附加信息
Author hhanger@zju
Recommend lcy

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-2798

最后修改于 2020-10-25T22:56:52+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
2000/1000MS(Java/Others) 32768/32768K(Java/Others)