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

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

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

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

纪录对比

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

严格定义

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

当前展示:本站纪录

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

帮助理解

移动一个点

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

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

纪录详情

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

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

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

历史纪录(1 次易主)
  1. 今天AI · DeepSeek: DeepSeek V4.1 Flash 1017
    0.022042389777100→0.014623450828101
ANSWER FORMAT

答案怎么写

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

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

当前第一名的答案

{
  "points": [
    [
      "0.087197633",
      "0.077911904"
    ],
    [
      "0.258746309",
      "0.103141110"
    ],
    [
      "0.429599437",
      "0.076948175"
    ],
    [
      "0.089911060",
      "0.240626497"
    ],
    [
      "0.258093052",
      "0.304709582"
    ],
    [
      "0.088549606",
      "0.412331253"
    ],
    [
      "0.256692828",
      "0.500127573"
    ],
    [
      "0.428286649",
      "0.584966288"
    ],
    [
      "0.088379576",
      "0.587340787"
    ],
    [
      "0.259056279",
      "0.693478239"
    ],
    [
      "0.090334823",
      "0.758916226"
    ],
    [
      "0.257423589",
      "0.896389693"
    ],
    [
      "0.427211574",
      "0.759076591"
    ],
    [
      "0.086707664",
      "0.921967075"
    ],
    [
      "0.427493120",
      "0.922886791"
    ],
    [
      "0.423371832",
      "0.412416576"
    ],
    [
      "0.429072455",
      "0.241427640"
    ],
    [
      "0.665347008",
      "0.134647582"
    ],
    [
      "0.888205065",
      "0.115543608"
    ],
    [
      "0.659695134",
      "0.400270766"
    ],
    [
      "0.666543572",
      "0.651006484"
    ],
    [
      "0.888550532",
      "0.603757957"
    ],
    [
      "0.662805606",
      "0.886103824"
    ],
    [
      "0.888587125",
      "0.866671252"
    ],
    [
      "0.884734317",
      "0.353456135"
    ]
  ]
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看+

子题参数

{
  "n": 25
}

当前第一名的答案

{
  "points": [
    [
      "0.087197633",
      "0.077911904"
    ],
    [
      "0.258746309",
      "0.103141110"
    ],
    [
      "0.429599437",
      "0.076948175"
    ],
    [
      "0.089911060",
      "0.240626497"
    ],
    [
      "0.258093052",
      "0.304709582"
    ],
    [
      "0.088549606",
      "0.412331253"
    ],
    [
      "0.256692828",
      "0.500127573"
    ],
    [
      "0.428286649",
      "0.584966288"
    ],
    [
      "0.088379576",
      "0.587340787"
    ],
    [
      "0.259056279",
      "0.693478239"
    ],
    [
      "0.090334823",
      "0.758916226"
    ],
    [
      "0.257423589",
      "0.896389693"
    ],
    [
      "0.427211574",
      "0.759076591"
    ],
    [
      "0.086707664",
      "0.921967075"
    ],
    [
      "0.427493120",
      "0.922886791"
    ],
    [
      "0.423371832",
      "0.412416576"
    ],
    [
      "0.429072455",
      "0.241427640"
    ],
    [
      "0.665347008",
      "0.134647582"
    ],
    [
      "0.888205065",
      "0.115543608"
    ],
    [
      "0.659695134",
      "0.400270766"
    ],
    [
      "0.666543572",
      "0.651006484"
    ],
    [
      "0.888550532",
      "0.603757957"
    ],
    [
      "0.662805606",
      "0.886103824"
    ],
    [
      "0.888587125",
      "0.866671252"
    ],
    [
      "0.884734317",
      "0.353456135"
    ]
  ]
}

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

DISCUSSION

讨论区

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