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

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

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

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

纪录对比

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

严格定义

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

当前展示:本站纪录

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

帮助理解

移动一个点

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

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

纪录详情

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

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

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

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

答案怎么写

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

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

当前第一名的答案

{
  "points": [
    [
      "0.431356368",
      "0.916900302"
    ],
    [
      "0.086195945",
      "0.252419768"
    ],
    [
      "0.433719439",
      "0.420339734"
    ],
    [
      "0.264223768",
      "0.799146872"
    ],
    [
      "0.255978200",
      "0.935406183"
    ],
    [
      "0.084217382",
      "0.084978018"
    ],
    [
      "0.260491455",
      "0.201138601"
    ],
    [
      "0.426893677",
      "0.582677047"
    ],
    [
      "0.257086344",
      "0.653105015"
    ],
    [
      "0.084577918",
      "0.915295579"
    ],
    [
      "0.429424185",
      "0.083511648"
    ],
    [
      "0.261037086",
      "0.348057404"
    ],
    [
      "0.434463101",
      "0.252302956"
    ],
    [
      "0.084972271",
      "0.582781147"
    ],
    [
      "0.256956367",
      "0.499891911"
    ],
    [
      "0.085884088",
      "0.417362044"
    ],
    [
      "0.255597338",
      "0.064520996"
    ],
    [
      "0.086561282",
      "0.748925271"
    ],
    [
      "0.888700223",
      "0.884997671"
    ],
    [
      "0.667007396",
      "0.865753291"
    ],
    [
      "0.663888123",
      "0.598079838"
    ],
    [
      "0.890278938",
      "0.397414210"
    ],
    [
      "0.889116215",
      "0.133506733"
    ],
    [
      "0.437382739",
      "0.746761661"
    ],
    [
      "0.671595175",
      "0.347757865"
    ],
    [
      "0.663814669",
      "0.112951634"
    ],
    [
      "0.885765471",
      "0.648073442"
    ]
  ]
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看+

子题参数

{
  "n": 27
}

当前第一名的答案

{
  "points": [
    [
      "0.431356368",
      "0.916900302"
    ],
    [
      "0.086195945",
      "0.252419768"
    ],
    [
      "0.433719439",
      "0.420339734"
    ],
    [
      "0.264223768",
      "0.799146872"
    ],
    [
      "0.255978200",
      "0.935406183"
    ],
    [
      "0.084217382",
      "0.084978018"
    ],
    [
      "0.260491455",
      "0.201138601"
    ],
    [
      "0.426893677",
      "0.582677047"
    ],
    [
      "0.257086344",
      "0.653105015"
    ],
    [
      "0.084577918",
      "0.915295579"
    ],
    [
      "0.429424185",
      "0.083511648"
    ],
    [
      "0.261037086",
      "0.348057404"
    ],
    [
      "0.434463101",
      "0.252302956"
    ],
    [
      "0.084972271",
      "0.582781147"
    ],
    [
      "0.256956367",
      "0.499891911"
    ],
    [
      "0.085884088",
      "0.417362044"
    ],
    [
      "0.255597338",
      "0.064520996"
    ],
    [
      "0.086561282",
      "0.748925271"
    ],
    [
      "0.888700223",
      "0.884997671"
    ],
    [
      "0.667007396",
      "0.865753291"
    ],
    [
      "0.663888123",
      "0.598079838"
    ],
    [
      "0.890278938",
      "0.397414210"
    ],
    [
      "0.889116215",
      "0.133506733"
    ],
    [
      "0.437382739",
      "0.746761661"
    ],
    [
      "0.671595175",
      "0.347757865"
    ],
    [
      "0.663814669",
      "0.112951634"
    ],
    [
      "0.885765471",
      "0.648073442"
    ]
  ]
}

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

DISCUSSION

讨论区

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