Solution of Ballons in a Box (ACM/ICPC 2002 Finals)

最新推荐文章于 2022-10-15 20:58:52 发布

zinocpp

最新推荐文章于 2022-10-15 20:58:52 发布

阅读量3.4k

点赞数

分类专栏： ACM/ICPC 文章标签： permutation vector integer each distance output

本文链接：https://blog.csdn.net/zinocpp/article/details/632194

版权

该博客讨论了一个 ACM/ICPC 2002 年决赛的编程问题，涉及如何在矩形箱内放置球体以最大化总体积。问题要求编写程序，按特定顺序放置球体，使其触碰箱子边界或已放置的球体，同时计算未被球体占据的箱内体积。输入包含多个测试用例，包括点的数量、箱子的坐标以及各点坐标。输出要求显示未被球体占据的体积，四舍五入到最近的整数。

摘要由CSDN通过智能技术生成

Problem

Balloons in a Box

Problem

You must write a program that simulates placing spherical balloons into a rectangular box.

The simulation scenario is as follows. Imagine that you are given a rectangular box and a set of points. Each point represents a position where you might place a balloon. To place a balloon at a point, center it at the point and inflate the balloon until it touches a side of the box or a previously placed balloon. You may not use a point that is outside the box or inside a previously placed balloon. However, you may use the points in any order you like, and you need not use every point. Your objective is to place balloons in the box in an order that maximizes the total volume occupied by the balloons.

You are required to calculat