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

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

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

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

纪录对比

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

严格定义

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

当前展示:本站纪录

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

帮助理解

移动一个点

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

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

纪录详情

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

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

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

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

答案怎么写

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

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

当前第一名的答案

{
  "points": [
    [
      "0.084403672",
      "0.082557738"
    ],
    [
      "0.255450186",
      "0.064208185"
    ],
    [
      "0.429836263",
      "0.084005124"
    ],
    [
      "0.087561682",
      "0.244632582"
    ],
    [
      "0.263728911",
      "0.199481669"
    ],
    [
      "0.087094114",
      "0.404111626"
    ],
    [
      "0.263240713",
      "0.344667709"
    ],
    [
      "0.433462537",
      "0.426399160"
    ],
    [
      "0.082661908",
      "0.563559290"
    ],
    [
      "0.258013728",
      "0.494453024"
    ],
    [
      "0.067686059",
      "0.730266505"
    ],
    [
      "0.236794050",
      "0.644859215"
    ],
    [
      "0.418428182",
      "0.590242980"
    ],
    [
      "0.188924488",
      "0.802131265"
    ],
    [
      "0.336883854",
      "0.770815246"
    ],
    [
      "0.079757052",
      "0.918614403"
    ],
    [
      "0.263869174",
      "0.931821957"
    ],
    [
      "0.435609628",
      "0.920130962"
    ],
    [
      "0.435579280",
      "0.255535489"
    ],
    [
      "0.660639428",
      "0.122330863"
    ],
    [
      "0.886243582",
      "0.094958676"
    ],
    [
      "0.661413932",
      "0.367454942"
    ],
    [
      "0.661133424",
      "0.608280818"
    ],
    [
      "0.883790468",
      "0.496849003"
    ],
    [
      "0.879792960",
      "0.704022962"
    ],
    [
      "0.671308106",
      "0.875426232"
    ],
    [
      "0.890484322",
      "0.903419409"
    ],
    [
      "0.472323378",
      "0.747122665"
    ],
    [
      "0.882627224",
      "0.291213828"
    ]
  ]
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看+

子题参数

{
  "n": 29
}

当前第一名的答案

{
  "points": [
    [
      "0.084403672",
      "0.082557738"
    ],
    [
      "0.255450186",
      "0.064208185"
    ],
    [
      "0.429836263",
      "0.084005124"
    ],
    [
      "0.087561682",
      "0.244632582"
    ],
    [
      "0.263728911",
      "0.199481669"
    ],
    [
      "0.087094114",
      "0.404111626"
    ],
    [
      "0.263240713",
      "0.344667709"
    ],
    [
      "0.433462537",
      "0.426399160"
    ],
    [
      "0.082661908",
      "0.563559290"
    ],
    [
      "0.258013728",
      "0.494453024"
    ],
    [
      "0.067686059",
      "0.730266505"
    ],
    [
      "0.236794050",
      "0.644859215"
    ],
    [
      "0.418428182",
      "0.590242980"
    ],
    [
      "0.188924488",
      "0.802131265"
    ],
    [
      "0.336883854",
      "0.770815246"
    ],
    [
      "0.079757052",
      "0.918614403"
    ],
    [
      "0.263869174",
      "0.931821957"
    ],
    [
      "0.435609628",
      "0.920130962"
    ],
    [
      "0.435579280",
      "0.255535489"
    ],
    [
      "0.660639428",
      "0.122330863"
    ],
    [
      "0.886243582",
      "0.094958676"
    ],
    [
      "0.661413932",
      "0.367454942"
    ],
    [
      "0.661133424",
      "0.608280818"
    ],
    [
      "0.883790468",
      "0.496849003"
    ],
    [
      "0.879792960",
      "0.704022962"
    ],
    [
      "0.671308106",
      "0.875426232"
    ],
    [
      "0.890484322",
      "0.903419409"
    ],
    [
      "0.472323378",
      "0.747122665"
    ],
    [
      "0.882627224",
      "0.291213828"
    ]
  ]
}

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

DISCUSSION

讨论区

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