P06 · 装箱与覆盖 · 经典问题 · 难

半径成等差的圆装入圆 · n = 20

把半径分别为 1, 2, …, n 的 n 个圆互不重叠地放进一个圆里,使容器的半径尽可能小。

严格定义

  • 容器圆心在 (radius, radius)、半径为 radius 的圆,radius 由你给出,它就是分数;单位取最小圆的半径
  • 提交radius 与 centers,centers 按半径 1, 2, …, n 的顺序排列
  • 约束第 i 个圆的半径恰好是 i;两两内部不重叠;每个圆完整落在容器圆内
  • 目标让容器半径尽可能小
放大来摆,然后提交
116.801134962y0
0x116.801134962
已验证构造r = 58.400567481

帮助理解

哪里有优化空间

大圆定骨架、小圆填缝:n 每加一,新来的最大圆都可能颠覆上一轮的整个布局。

前沿在哪里

半径 1..n 装入最小圆正是 2005 年 Al Zimmermann 程序设计竞赛的赛题(n = 5..50),全部最好结果收录在 Packomania 的 ccin 表,但证明一个也没有。本站尚未录入这些值。

查看来源
当前第一名

58.400567481

容器半径

已追平已知最好
纪录保持者创始基准
解题方式人工
挑战这个纪录
ANSWER FORMAT

答案怎么写

单位就是最小那个圆的半径:第 i 个圆的半径正好是 i。容器是你自己给出的圆,圆心在 (radius, radius),所以坐标范围是 0 到 2·radius,radius 越小越好。坐标和半径用同一个单位,直接写成小数,例如 "7.5",最多九位小数。

提交 radius 与 centers,centers 按半径 1,2,…,n 的顺序排列。容器圆心在 (radius, radius)。每个数写成十进制字符串,例如 "7.5"。

当前第一名的答案

{
  "centers": [
    [
      "8.689041906",
      "36.788632938"
    ],
    [
      "108.329286854",
      "84.261518135"
    ],
    [
      "55.906274413",
      "113.354625709"
    ],
    [
      "18.40847212",
      "94.961493118"
    ],
    [
      "110.54921953",
      "46.905407772"
    ],
    [
      "34.557155887",
      "11.738900174"
    ],
    [
      "83.895842679",
      "13.768636312"
    ],
    [
      "84.947388432",
      "101.243110587"
    ],
    [
      "97.263060273",
      "88.804015701"
    ],
    [
      "67.566998284",
      "105.925208235"
    ],
    [
      "72.191767591",
      "51.325337894"
    ],
    [
      "12.43398815",
      "52.069197401"
    ],
    [
      "16.841441427",
      "76.677617823"
    ],
    [
      "25.016854038",
      "29.316802229"
    ],
    [
      "101.346996632",
      "64.662634294"
    ],
    [
      "93.475701842",
      "34.678593233"
    ],
    [
      "72.907945735",
      "79.333025704"
    ],
    [
      "41.706418741",
      "95.190664662"
    ],
    [
      "42.976441624",
      "58.212467816"
    ],
    [
      "58.29475112",
      "22.346754463"
    ]
  ],
  "radius": "58.400567481"
}
提交格式与技术细节需要编写程序或准备 JSON 答案时再查看

子题参数

{
  "n": 20
}

当前第一名的答案

{
  "centers": [
    [
      "8.689041906",
      "36.788632938"
    ],
    [
      "108.329286854",
      "84.261518135"
    ],
    [
      "55.906274413",
      "113.354625709"
    ],
    [
      "18.40847212",
      "94.961493118"
    ],
    [
      "110.54921953",
      "46.905407772"
    ],
    [
      "34.557155887",
      "11.738900174"
    ],
    [
      "83.895842679",
      "13.768636312"
    ],
    [
      "84.947388432",
      "101.243110587"
    ],
    [
      "97.263060273",
      "88.804015701"
    ],
    [
      "67.566998284",
      "105.925208235"
    ],
    [
      "72.191767591",
      "51.325337894"
    ],
    [
      "12.43398815",
      "52.069197401"
    ],
    [
      "16.841441427",
      "76.677617823"
    ],
    [
      "25.016854038",
      "29.316802229"
    ],
    [
      "101.346996632",
      "64.662634294"
    ],
    [
      "93.475701842",
      "34.678593233"
    ],
    [
      "72.907945735",
      "79.333025704"
    ],
    [
      "41.706418741",
      "95.190664662"
    ],
    [
      "42.976441624",
      "58.212467816"
    ],
    [
      "58.29475112",
      "22.346754463"
    ]
  ],
  "radius": "58.400567481"
}

提交 radius 与 centers,centers 按半径 1,2,…,n 的顺序排列。容器圆心在 (radius, radius)。每个数写成十进制字符串,例如 "7.5"。 · 验证器 v1.0.0