P75 · 极值构型 · 本站原创 · 应用前沿 · 难

用 n 个等圆覆盖正五边形 · n = 35

把 n 个等半径圆盘的圆心放进正五边形，使圆盘并集覆盖整个五边形，并把共同半径压到最小。

子题n = 35

目标最小化覆盖半径

已证明下界√(A(K)/(π·35))任何布局都不低于 0.073524861107014 · 当前纪录高出下界 22.4%这里 K 是验证器使用的固定精度正五边形，A(K) 是它的面积。面积下界：nπr² 至少等于 A(K)，所以 r ≥ √(A(K)/(πn))；页面数值按 A(K) 的精确有理值向下取整

严格定义

容器顶点依次为 (0.5,1)、(0.024471742,0.654508497)、(0.206107374,0.095491503)、(0.793892626,0.095491503)、(0.975528258,0.654508497) 的闭凸多边形
提交恰好 n 个互不重合、且位于容器内的点
分数容器中最难覆盖的位置到最近圆心的距离；由有理 Voronoi 多边形的有限顶点精确决定 $r (P) = \max_{x \in K} \min_{i} ‖ x - p_{i} ‖$
目标让覆盖半径尽可能小 $\min_{P} r (P)$

放大来摆，然后提交 ↗

已验证构造35 个等圆盘，共同半径 0.090030；标出的那一点是最难够到的位置，半径由它决定

帮助理解

五重对称不等于答案也五重对称

边界有五个角，但 n 往往不是 5 的倍数。额外圆心放在哪一侧，会迫使内部 Voronoi 结构重新分配；随着 n 改变，最远空洞的位置和邻接拓扑也会改变，并不存在一套显然可以反复复制的周期图案。

公开研究只解决了一个小规模

Liu（2022）研究了正五边形中的连续 p-center，并公开展示了 n=3–10 的构型。只有 n=5 的上下界闭合；n=7、8、9、10 在两小时计算后仍分别留下 5.87%、5.75%、6.35%、10.24% 的差距。本站已从 Figure 9 的矢量对象逐点复原 n=7–10，并以验证器实际算出的半径作为 known best。n=11–35 暂未找到可公开复现的外部构型，因此只提供本站多起点搜索基准，不冒充 SOTA。

查看来源

当前第一名

0.090029574630320

覆盖半径

答案来源MinMax Arena

解题方式本站离线搜索

挑战这个纪录 ↗

ANSWER FORMAT

答案怎么写

容器是外接圆直径为 1、一个顶点朝上的正五边形在九位坐标格上的明确代表。页面严格定义列出验证器实际使用的五个顶点。

提交 points：恰好 n 个圆心，坐标是最多九位小数的字符串。半径由验证器精确算出，越小越好。

当前第一名的答案

{
  "points": [
    [
      "0.361691155",
      "0.872016587"
    ],
    [
      "0.258660935",
      "0.553063199"
    ],
    [
      "0.259032808",
      "0.751018079"
    ],
    [
      "0.872872149",
      "0.522708012"
    ],
    [
      "0.167807717",
      "0.670081067"
    ],
    [
      "0.899883152",
      "0.64720081"
    ],
    [
      "0.380163258",
      "0.247290341"
    ],
    [
      "0.615123732",
      "0.161668797"
    ],
    [
      "0.830384591",
      "0.389198189"
    ],
    [
      "0.717009739",
      "0.433758111"
    ],
    [
      "0.434806572",
      "0.401494595"
    ],
    [
      "0.431596381",
      "0.771074959"
    ],
    [
      "0.743060334",
      "0.560319837"
    ],
    [
      "0.343166805",
      "0.64821678"
    ],
    [
      "0.738802255",
      "0.160145522"
    ],
    [
      "0.180564041",
      "0.323105335"
    ],
    [
      "0.358988221",
      "0.103907429"
    ],
    [
      "0.501334224",
      "0.168433211"
    ],
    [
      "0.28099009",
      "0.459275687"
    ],
    [
      "0.786700969",
      "0.695661668"
    ],
    [
      "0.138672943",
      "0.468441812"
    ],
    [
      "0.630432352",
      "0.607593625"
    ],
    [
      "0.433311246",
      "0.529072212"
    ],
    [
      "0.587097676",
      "0.471786208"
    ],
    [
      "0.532589592",
      "0.317472141"
    ],
    [
      "0.09733159",
      "0.607640248"
    ],
    [
      "0.716946878",
      "0.741399741"
    ],
    [
      "0.655138101",
      "0.872432707"
    ],
    [
      "0.652583415",
      "0.312760342"
    ],
    [
      "0.503489991",
      "0.910078973"
    ],
    [
      "0.227248669",
      "0.174966002"
    ],
    [
      "0.491834222",
      "0.6190831"
    ],
    [
      "0.780243541",
      "0.267280735"
    ],
    [
      "0.30943983",
      "0.320416204"
    ],
    [
      "0.572081661",
      "0.75800888"
    ]
  ]
}

提交格式与技术细节需要编写程序或准备 JSON 答案时再查看＋

子题参数

{
  "n": 35
}

当前第一名的答案

{
  "points": [
    [
      "0.361691155",
      "0.872016587"
    ],
    [
      "0.258660935",
      "0.553063199"
    ],
    [
      "0.259032808",
      "0.751018079"
    ],
    [
      "0.872872149",
      "0.522708012"
    ],
    [
      "0.167807717",
      "0.670081067"
    ],
    [
      "0.899883152",
      "0.64720081"
    ],
    [
      "0.380163258",
      "0.247290341"
    ],
    [
      "0.615123732",
      "0.161668797"
    ],
    [
      "0.830384591",
      "0.389198189"
    ],
    [
      "0.717009739",
      "0.433758111"
    ],
    [
      "0.434806572",
      "0.401494595"
    ],
    [
      "0.431596381",
      "0.771074959"
    ],
    [
      "0.743060334",
      "0.560319837"
    ],
    [
      "0.343166805",
      "0.64821678"
    ],
    [
      "0.738802255",
      "0.160145522"
    ],
    [
      "0.180564041",
      "0.323105335"
    ],
    [
      "0.358988221",
      "0.103907429"
    ],
    [
      "0.501334224",
      "0.168433211"
    ],
    [
      "0.28099009",
      "0.459275687"
    ],
    [
      "0.786700969",
      "0.695661668"
    ],
    [
      "0.138672943",
      "0.468441812"
    ],
    [
      "0.630432352",
      "0.607593625"
    ],
    [
      "0.433311246",
      "0.529072212"
    ],
    [
      "0.587097676",
      "0.471786208"
    ],
    [
      "0.532589592",
      "0.317472141"
    ],
    [
      "0.09733159",
      "0.607640248"
    ],
    [
      "0.716946878",
      "0.741399741"
    ],
    [
      "0.655138101",
      "0.872432707"
    ],
    [
      "0.652583415",
      "0.312760342"
    ],
    [
      "0.503489991",
      "0.910078973"
    ],
    [
      "0.227248669",
      "0.174966002"
    ],
    [
      "0.491834222",
      "0.6190831"
    ],
    [
      "0.780243541",
      "0.267280735"
    ],
    [
      "0.30943983",
      "0.320416204"
    ],
    [
      "0.572081661",
      "0.75800888"
    ]
  ]
}

提交 points：恰好 n 个圆心，坐标是最多九位小数的字符串。半径由验证器精确算出，越小越好。 · 验证器 v1.0.0

DISCUSSION

讨论区

聊思路、贴方法、问为什么卡住。发帖即公开署名，与纪录同一个名字；署名后的 #编号是账号的注册序号，冒不了名。发言资格与实绩绑定：破过一次纪录，就永久拥有发言权。新发言经自动审核后公开。

还没有帖子。第一个聊聊这道题的思路？