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

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

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

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

纪录对比

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

严格定义

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

当前展示:本站纪录

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

帮助理解

移动一个点

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

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

纪录详情

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

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

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

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

答案怎么写

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

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

当前第一名的答案

{
  "points": [
    [
      "0.084283357",
      "0.089125421"
    ],
    [
      "0.255927943",
      "0.068465917"
    ],
    [
      "0.429272105",
      "0.087583101"
    ],
    [
      "0.086133431",
      "0.264649946"
    ],
    [
      "0.259535360",
      "0.214143298"
    ],
    [
      "0.086672372",
      "0.436181582"
    ],
    [
      "0.260654433",
      "0.372757726"
    ],
    [
      "0.433231547",
      "0.263786391"
    ],
    [
      "0.087131020",
      "0.605378374"
    ],
    [
      "0.432805694",
      "0.438588659"
    ],
    [
      "0.088787242",
      "0.768909548"
    ],
    [
      "0.256553477",
      "0.540602443"
    ],
    [
      "0.424552332",
      "0.605585128"
    ],
    [
      "0.258810611",
      "0.718925874"
    ],
    [
      "0.431548154",
      "0.767897563"
    ],
    [
      "0.258991925",
      "0.904657330"
    ],
    [
      "0.086876326",
      "0.924670127"
    ],
    [
      "0.662680658",
      "0.114487210"
    ],
    [
      "0.888558489",
      "0.133106889"
    ],
    [
      "0.670327490",
      "0.351060171"
    ],
    [
      "0.661450641",
      "0.602258293"
    ],
    [
      "0.889824335",
      "0.396242081"
    ],
    [
      "0.885410850",
      "0.646328696"
    ],
    [
      "0.430349233",
      "0.925456396"
    ],
    [
      "0.888728414",
      "0.884248888"
    ],
    [
      "0.666741137",
      "0.866492447"
    ]
  ]
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看+

子题参数

{
  "n": 26
}

当前第一名的答案

{
  "points": [
    [
      "0.084283357",
      "0.089125421"
    ],
    [
      "0.255927943",
      "0.068465917"
    ],
    [
      "0.429272105",
      "0.087583101"
    ],
    [
      "0.086133431",
      "0.264649946"
    ],
    [
      "0.259535360",
      "0.214143298"
    ],
    [
      "0.086672372",
      "0.436181582"
    ],
    [
      "0.260654433",
      "0.372757726"
    ],
    [
      "0.433231547",
      "0.263786391"
    ],
    [
      "0.087131020",
      "0.605378374"
    ],
    [
      "0.432805694",
      "0.438588659"
    ],
    [
      "0.088787242",
      "0.768909548"
    ],
    [
      "0.256553477",
      "0.540602443"
    ],
    [
      "0.424552332",
      "0.605585128"
    ],
    [
      "0.258810611",
      "0.718925874"
    ],
    [
      "0.431548154",
      "0.767897563"
    ],
    [
      "0.258991925",
      "0.904657330"
    ],
    [
      "0.086876326",
      "0.924670127"
    ],
    [
      "0.662680658",
      "0.114487210"
    ],
    [
      "0.888558489",
      "0.133106889"
    ],
    [
      "0.670327490",
      "0.351060171"
    ],
    [
      "0.661450641",
      "0.602258293"
    ],
    [
      "0.889824335",
      "0.396242081"
    ],
    [
      "0.885410850",
      "0.646328696"
    ],
    [
      "0.430349233",
      "0.925456396"
    ],
    [
      "0.888728414",
      "0.884248888"
    ],
    [
      "0.666741137",
      "0.866492447"
    ]
  ]
}

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

DISCUSSION

讨论区

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