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

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

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

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

纪录对比

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

严格定义

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

当前展示:本站纪录

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

帮助理解

移动一个点

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

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

纪录详情

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

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

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

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

答案怎么写

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

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

当前第一名的答案

{
  "points": [
    [
      "0.465168317",
      "0.461046723"
    ],
    [
      "0.272275094",
      "0.061866899"
    ],
    [
      "0.430799121",
      "0.926753958"
    ],
    [
      "0.063591522",
      "0.243289210"
    ],
    [
      "0.203379411",
      "0.484865588"
    ],
    [
      "0.203370334",
      "0.325149989"
    ],
    [
      "0.207228441",
      "0.653798529"
    ],
    [
      "0.068167044",
      "0.410309966"
    ],
    [
      "0.081309498",
      "0.072370751"
    ],
    [
      "0.190453466",
      "0.811064531"
    ],
    [
      "0.331279891",
      "0.758807167"
    ],
    [
      "0.266273705",
      "0.930926193"
    ],
    [
      "0.081200032",
      "0.923666412"
    ],
    [
      "0.467882954",
      "0.271213739"
    ],
    [
      "0.330093864",
      "0.559708892"
    ],
    [
      "0.189712903",
      "0.175180344"
    ],
    [
      "0.448196154",
      "0.630401259"
    ],
    [
      "0.064437300",
      "0.746865460"
    ],
    [
      "0.069998540",
      "0.577855636"
    ],
    [
      "0.341159825",
      "0.383678902"
    ],
    [
      "0.335195714",
      "0.213357180"
    ],
    [
      "0.673113353",
      "0.880677482"
    ],
    [
      "0.884428149",
      "0.708203955"
    ],
    [
      "0.887159030",
      "0.291814409"
    ],
    [
      "0.670050976",
      "0.123260906"
    ],
    [
      "0.442167413",
      "0.083098240"
    ],
    [
      "0.672316801",
      "0.623907878"
    ],
    [
      "0.890946827",
      "0.904640859"
    ],
    [
      "0.679416938",
      "0.375510380"
    ],
    [
      "0.889016472",
      "0.094892084"
    ],
    [
      "0.887381908",
      "0.501031547"
    ],
    [
      "0.470656345",
      "0.782297714"
    ]
  ]
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看+

子题参数

{
  "n": 32
}

当前第一名的答案

{
  "points": [
    [
      "0.465168317",
      "0.461046723"
    ],
    [
      "0.272275094",
      "0.061866899"
    ],
    [
      "0.430799121",
      "0.926753958"
    ],
    [
      "0.063591522",
      "0.243289210"
    ],
    [
      "0.203379411",
      "0.484865588"
    ],
    [
      "0.203370334",
      "0.325149989"
    ],
    [
      "0.207228441",
      "0.653798529"
    ],
    [
      "0.068167044",
      "0.410309966"
    ],
    [
      "0.081309498",
      "0.072370751"
    ],
    [
      "0.190453466",
      "0.811064531"
    ],
    [
      "0.331279891",
      "0.758807167"
    ],
    [
      "0.266273705",
      "0.930926193"
    ],
    [
      "0.081200032",
      "0.923666412"
    ],
    [
      "0.467882954",
      "0.271213739"
    ],
    [
      "0.330093864",
      "0.559708892"
    ],
    [
      "0.189712903",
      "0.175180344"
    ],
    [
      "0.448196154",
      "0.630401259"
    ],
    [
      "0.064437300",
      "0.746865460"
    ],
    [
      "0.069998540",
      "0.577855636"
    ],
    [
      "0.341159825",
      "0.383678902"
    ],
    [
      "0.335195714",
      "0.213357180"
    ],
    [
      "0.673113353",
      "0.880677482"
    ],
    [
      "0.884428149",
      "0.708203955"
    ],
    [
      "0.887159030",
      "0.291814409"
    ],
    [
      "0.670050976",
      "0.123260906"
    ],
    [
      "0.442167413",
      "0.083098240"
    ],
    [
      "0.672316801",
      "0.623907878"
    ],
    [
      "0.890946827",
      "0.904640859"
    ],
    [
      "0.679416938",
      "0.375510380"
    ],
    [
      "0.889016472",
      "0.094892084"
    ],
    [
      "0.887381908",
      "0.501031547"
    ],
    [
      "0.470656345",
      "0.782297714"
    ]
  ]
}

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

DISCUSSION

讨论区

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