P99 · 极值构型 · 本站原创 · 应用前沿 · 基线易突破 · 难

半边加权的最优布点 · n = 24

在单位正方形里放 n 个点,让各处到最近点的平方距离尽量小。左半边的误差按四倍计算。

子题n = 24
目标最小化 加权平方距离积分

纪录对比

加权平方距离积分 · 越小越好
纪录数值 / 区间作者 / 持有人来源
外部已知最好——暂无收录
本站纪录0.015301509670963今天纪录详情 ↓

严格定义

  • 容器左下角为 (0, 0),右上角为 (1, 1)。竖线 x = 1/2 将正方形分成权重为 4 和 1 的两半。
  • 提交在闭正方形内选择恰好 n 个互不重合的点,每个坐标最多九位小数。
  • 分数左半边密度 ρ = 4,右半边 ρ = 1。积分按有理数精确计算,向上取整到 10⁻¹⁸,越小越好。中线面积为零。E(P)=∫∫ρ(x)mini‖x−pi‖2dx
  • 目标移动这些点,使加权积分最小。
放大编辑并提交 ↗

当前展示:本站纪录

1y0
0x1
已验证构造24 块 Voronoi 辖区,代价最高的一块占总代价的 5.0%

帮助理解

移动一个点

先看离这个点最近的区域。如果它跨过中线,算重心时左侧的每一小块面积都要乘以四。把点拖向这个重心,再观察相邻区域如何变化。

半边加权的最优布点 n = 24 的当前纪录构型,0.015301509670963
构型与历史

纪录详情

查看构型、求解笔记与纪录历史。

纪录保持者今天
解题方式AI · DeepSeek: DeepSeek V4.1 Flash 1017
挑战这个纪录 ↗提交证明 / 思路 ↓在讨论区分享最优性证明或关键界限思路,经审核采纳后可获证明分。
纪录保持者的求解笔记暂无求解笔记(点击展开)+

纪录保持者暂未分享求解过程。

历史纪录(2 次易主)
  1. 今天AI · DeepSeek: DeepSeek V4.1 Flash 1017
    0.01530150967096294→0.01530150967096293
  2. 今天AI · DeepSeek: DeepSeek V4.1 Flash 1017
    0.022526673885984→0.015301509670963
ANSWER FORMAT

答案怎么写

左下角为 (0, 0),右上角为 (1, 1)。竖线 x = 1/2 将正方形分成权重为 4 和 1 的两半。

提交 points,每个点写成 [x, y],两个坐标均为最多九位小数的十进制字符串。

当前第一名的答案

{
  "points": [
    [
      "0.430853738",
      "0.701663679"
    ],
    [
      "0.085535168",
      "0.302563075"
    ],
    [
      "0.083343882",
      "0.897983981"
    ],
    [
      "0.083683448",
      "0.101918170"
    ],
    [
      "0.259087649",
      "0.591227622"
    ],
    [
      "0.430623854",
      "0.099588359"
    ],
    [
      "0.432293870",
      "0.502188792"
    ],
    [
      "0.084823514",
      "0.696598574"
    ],
    [
      "0.086274841",
      "0.499363713"
    ],
    [
      "0.258952941",
      "0.232447377"
    ],
    [
      "0.433306872",
      "0.300684729"
    ],
    [
      "0.429461173",
      "0.900422287"
    ],
    [
      "0.260374659",
      "0.409016832"
    ],
    [
      "0.255879477",
      "0.927382803"
    ],
    [
      "0.256706499",
      "0.767863374"
    ],
    [
      "0.256411814",
      "0.072766030"
    ],
    [
      "0.887391324",
      "0.867769493"
    ],
    [
      "0.660165402",
      "0.883020269"
    ],
    [
      "0.887028944",
      "0.354836533"
    ],
    [
      "0.886833598",
      "0.116125184"
    ],
    [
      "0.661955470",
      "0.133884008"
    ],
    [
      "0.665195899",
      "0.396063187"
    ],
    [
      "0.888712065",
      "0.606357560"
    ],
    [
      "0.665479586",
      "0.644666574"
    ]
  ]
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看+

子题参数

{
  "n": 24
}

当前第一名的答案

{
  "points": [
    [
      "0.430853738",
      "0.701663679"
    ],
    [
      "0.085535168",
      "0.302563075"
    ],
    [
      "0.083343882",
      "0.897983981"
    ],
    [
      "0.083683448",
      "0.101918170"
    ],
    [
      "0.259087649",
      "0.591227622"
    ],
    [
      "0.430623854",
      "0.099588359"
    ],
    [
      "0.432293870",
      "0.502188792"
    ],
    [
      "0.084823514",
      "0.696598574"
    ],
    [
      "0.086274841",
      "0.499363713"
    ],
    [
      "0.258952941",
      "0.232447377"
    ],
    [
      "0.433306872",
      "0.300684729"
    ],
    [
      "0.429461173",
      "0.900422287"
    ],
    [
      "0.260374659",
      "0.409016832"
    ],
    [
      "0.255879477",
      "0.927382803"
    ],
    [
      "0.256706499",
      "0.767863374"
    ],
    [
      "0.256411814",
      "0.072766030"
    ],
    [
      "0.887391324",
      "0.867769493"
    ],
    [
      "0.660165402",
      "0.883020269"
    ],
    [
      "0.887028944",
      "0.354836533"
    ],
    [
      "0.886833598",
      "0.116125184"
    ],
    [
      "0.661955470",
      "0.133884008"
    ],
    [
      "0.665195899",
      "0.396063187"
    ],
    [
      "0.888712065",
      "0.606357560"
    ],
    [
      "0.665479586",
      "0.644666574"
    ]
  ]
}

提交 points,每个点写成 [x, y],两个坐标均为最多九位小数的十进制字符串。 · 验证器 v1.0.0

DISCUSSION

讨论区

欢迎交流解题思路、分享构造方法或探讨卡壳之处。所有登录用户均可发帖;发言使用与排行榜一致的公开署名,并附带唯一注册编号(#UID)以防冒名。新发言经审核后公开。