单位正方形里的照明 · n = 26
在单位正方形内放 n 个单位亮度的光源,一点的光强是各光源到它距离平方倒数之和;让最暗的那一点尽可能亮。
子题n = 26
目标最大化 最小光强
严格定义
- 容器单位正方形:左下角是原点 (0, 0),右上角是 (1, 1)
- 提交n 个光源坐标 lights,外加你声称的最小光强 intensity,验证器只接受它能证明的下界
- 约束光源都在正方形内;允许多个光源位于同一点,亮度直接相加
- 目标让正方形内最暗一点的光强尽可能大
在单位正方形内放 n 个单位亮度的光源,一点的光强是各光源到它距离平方倒数之和;让最暗的那一点尽可能亮。
最暗点藏在光源之间的鞍点和角落里:补亮这里,别处就暗下去。均匀网格远非最优,边角需要超配。
Friedman 的公开表给出了逐 n 的 best-known 构型和数值,但没有最优性证明。本站已从图中重建这些构型,并把九位坐标下能严格证明的光强标作追赶目标;达到它仍不代表问题已经解决。
查看来源最小光强
容器是边长 1 的正方形,左下角是原点 (0, 0),右上角是 (1, 1)。坐标写成小数,例如 "0.25",最多九位小数。光强不是坐标,它是一个大于 1 的数,最多六位小数。
提交 lights 与 intensity。lights 是 n 个光源坐标,写成十进制字符串。intensity 是你声称正方形内任何一点都不低于的光强,最多六位小数。验证器会严格证明这个下界,证不出来就拒收,所以把它报得比你实际达到的最小值略低一点。某点的光强是各光源到该点距离平方的倒数之和。
{
"intensity": "234.745113",
"lights": [
[
"0.269984039",
"0.978777620"
],
[
"0.730015961",
"0.978777620"
],
[
"0.500000000",
"0.972694746"
],
[
"0.060222783",
"0.949221799"
],
[
"0.939777217",
"0.949221799"
],
[
"0.500000000",
"0.763578118"
],
[
"0.260720678",
"0.752850924"
],
[
"0.739279322",
"0.752850924"
],
[
"0.016378459",
"0.745836827"
],
[
"0.983621541",
"0.745836827"
],
[
"0.015783970",
"0.500000000"
],
[
"0.132999525",
"0.500000000"
],
[
"0.382418611",
"0.500000000"
],
[
"0.617581389",
"0.500000000"
],
[
"0.867000475",
"0.500000000"
],
[
"0.984216030",
"0.500000000"
],
[
"0.016378459",
"0.254163173"
],
[
"0.983621541",
"0.254163173"
],
[
"0.260720678",
"0.247149076"
],
[
"0.739279322",
"0.247149076"
],
[
"0.500000000",
"0.236421882"
],
[
"0.060222783",
"0.050778201"
],
[
"0.939777217",
"0.050778201"
],
[
"0.500000000",
"0.027305254"
],
[
"0.269984039",
"0.021222380"
],
[
"0.730015961",
"0.021222380"
]
]
}{
"n": 26
}{
"intensity": "234.745113",
"lights": [
[
"0.269984039",
"0.978777620"
],
[
"0.730015961",
"0.978777620"
],
[
"0.500000000",
"0.972694746"
],
[
"0.060222783",
"0.949221799"
],
[
"0.939777217",
"0.949221799"
],
[
"0.500000000",
"0.763578118"
],
[
"0.260720678",
"0.752850924"
],
[
"0.739279322",
"0.752850924"
],
[
"0.016378459",
"0.745836827"
],
[
"0.983621541",
"0.745836827"
],
[
"0.015783970",
"0.500000000"
],
[
"0.132999525",
"0.500000000"
],
[
"0.382418611",
"0.500000000"
],
[
"0.617581389",
"0.500000000"
],
[
"0.867000475",
"0.500000000"
],
[
"0.984216030",
"0.500000000"
],
[
"0.016378459",
"0.254163173"
],
[
"0.983621541",
"0.254163173"
],
[
"0.260720678",
"0.247149076"
],
[
"0.739279322",
"0.247149076"
],
[
"0.500000000",
"0.236421882"
],
[
"0.060222783",
"0.050778201"
],
[
"0.939777217",
"0.050778201"
],
[
"0.500000000",
"0.027305254"
],
[
"0.269984039",
"0.021222380"
],
[
"0.730015961",
"0.021222380"
]
]
}提交 lights 与 intensity。lights 是 n 个光源坐标,写成十进制字符串。intensity 是你声称正方形内任何一点都不低于的光强,最多六位小数。验证器会严格证明这个下界,证不出来就拒收,所以把它报得比你实际达到的最小值略低一点。某点的光强是各光源到该点距离平方的倒数之和。 · 验证器 v1.0.0
聊思路、贴方法、问为什么卡住。发帖即公开署名,与纪录同一个名字;署名后的 #编号是账号的注册序号,冒不了名。发言资格与实绩绑定:破过一次纪录,就永久拥有发言权。新发言经自动审核后公开。
还没有帖子。第一个聊聊这道题的思路?