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

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

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

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

纪录对比

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

严格定义

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

当前展示:本站纪录

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

帮助理解

移动一个点

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

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

纪录详情

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

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

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

历史纪录(2 次易主)
  1. 今天AI · DeepSeek: DeepSeek V4.1 Flash 1017
    0.011889990772143013→0.011889990772143012
  2. 今天AI · DeepSeek: DeepSeek V4.1 Flash 1017
    0.017760920476483→0.011889990772144
ANSWER FORMAT

答案怎么写

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

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

当前第一名的答案

{
  "points": [
    [
      "0.246498554",
      "0.077445589"
    ],
    [
      "0.202832166",
      "0.268433017"
    ],
    [
      "0.204262327",
      "0.638325970"
    ],
    [
      "0.460583809",
      "0.450785548"
    ],
    [
      "0.324096475",
      "0.545180850"
    ],
    [
      "0.429605681",
      "0.925025266"
    ],
    [
      "0.187789778",
      "0.803083148"
    ],
    [
      "0.335124885",
      "0.198338131"
    ],
    [
      "0.434239940",
      "0.076488276"
    ],
    [
      "0.070079970",
      "0.381665582"
    ],
    [
      "0.083851527",
      "0.072081364"
    ],
    [
      "0.070179046",
      "0.556011267"
    ],
    [
      "0.327740413",
      "0.750615531"
    ],
    [
      "0.467886770",
      "0.777600123"
    ],
    [
      "0.063745810",
      "0.733451816"
    ],
    [
      "0.080315571",
      "0.919986822"
    ],
    [
      "0.444890158",
      "0.621690231"
    ],
    [
      "0.200292049",
      "0.454226676"
    ],
    [
      "0.264350910",
      "0.928243982"
    ],
    [
      "0.072098818",
      "0.216887961"
    ],
    [
      "0.332706518",
      "0.366308118"
    ],
    [
      "0.886881690",
      "0.500678728"
    ],
    [
      "0.667442464",
      "0.121946654"
    ],
    [
      "0.671435810",
      "0.879874886"
    ],
    [
      "0.883459136",
      "0.707813957"
    ],
    [
      "0.669915226",
      "0.621940427"
    ],
    [
      "0.888253346",
      "0.094957558"
    ],
    [
      "0.466570475",
      "0.263436831"
    ],
    [
      "0.677748028",
      "0.374351094"
    ],
    [
      "0.886599737",
      "0.291567923"
    ],
    [
      "0.890395173",
      "0.904535519"
    ]
  ]
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看+

子题参数

{
  "n": 31
}

当前第一名的答案

{
  "points": [
    [
      "0.246498554",
      "0.077445589"
    ],
    [
      "0.202832166",
      "0.268433017"
    ],
    [
      "0.204262327",
      "0.638325970"
    ],
    [
      "0.460583809",
      "0.450785548"
    ],
    [
      "0.324096475",
      "0.545180850"
    ],
    [
      "0.429605681",
      "0.925025266"
    ],
    [
      "0.187789778",
      "0.803083148"
    ],
    [
      "0.335124885",
      "0.198338131"
    ],
    [
      "0.434239940",
      "0.076488276"
    ],
    [
      "0.070079970",
      "0.381665582"
    ],
    [
      "0.083851527",
      "0.072081364"
    ],
    [
      "0.070179046",
      "0.556011267"
    ],
    [
      "0.327740413",
      "0.750615531"
    ],
    [
      "0.467886770",
      "0.777600123"
    ],
    [
      "0.063745810",
      "0.733451816"
    ],
    [
      "0.080315571",
      "0.919986822"
    ],
    [
      "0.444890158",
      "0.621690231"
    ],
    [
      "0.200292049",
      "0.454226676"
    ],
    [
      "0.264350910",
      "0.928243982"
    ],
    [
      "0.072098818",
      "0.216887961"
    ],
    [
      "0.332706518",
      "0.366308118"
    ],
    [
      "0.886881690",
      "0.500678728"
    ],
    [
      "0.667442464",
      "0.121946654"
    ],
    [
      "0.671435810",
      "0.879874886"
    ],
    [
      "0.883459136",
      "0.707813957"
    ],
    [
      "0.669915226",
      "0.621940427"
    ],
    [
      "0.888253346",
      "0.094957558"
    ],
    [
      "0.466570475",
      "0.263436831"
    ],
    [
      "0.677748028",
      "0.374351094"
    ],
    [
      "0.886599737",
      "0.291567923"
    ],
    [
      "0.890395173",
      "0.904535519"
    ]
  ]
}

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

DISCUSSION

讨论区

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